./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 20:40:47,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 20:40:47,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 20:40:47,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 20:40:47,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 20:40:47,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 20:40:47,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 20:40:47,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 20:40:47,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 20:40:47,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 20:40:47,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 20:40:47,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 20:40:47,453 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 20:40:47,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 20:40:47,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 20:40:47,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 20:40:47,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 20:40:47,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 20:40:47,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 20:40:47,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 20:40:47,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:40:47,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 20:40:47,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:40:47,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:40:47,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:40:47,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:40:47,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 20:40:47,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 20:40:47,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 20:40:47,456 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 20:40:47,457 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 20:40:47,457 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2025-04-24 20:40:47,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 20:40:47,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 20:40:47,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 20:40:47,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 20:40:47,672 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 20:40:47,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-04-24 20:40:48,955 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c48d5ce44/2ed2776789c2459b94425c5f7952f609/FLAGe50fd8315 [2025-04-24 20:40:49,194 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 20:40:49,194 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-04-24 20:40:49,202 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c48d5ce44/2ed2776789c2459b94425c5f7952f609/FLAGe50fd8315 [2025-04-24 20:40:49,956 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c48d5ce44/2ed2776789c2459b94425c5f7952f609 [2025-04-24 20:40:49,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 20:40:49,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 20:40:49,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 20:40:49,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 20:40:49,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 20:40:49,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:40:49" (1/1) ... [2025-04-24 20:40:49,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a70313d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:49, skipping insertion in model container [2025-04-24 20:40:49,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:40:49" (1/1) ... [2025-04-24 20:40:49,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 20:40:50,203 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-deagle/circular_buffer_bad.i[30440,30453] [2025-04-24 20:40:50,211 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-deagle/circular_buffer_bad.i[30895,30908] [2025-04-24 20:40:50,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:40:50,225 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 20:40:50,286 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-deagle/circular_buffer_bad.i[30440,30453] [2025-04-24 20:40:50,288 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-deagle/circular_buffer_bad.i[30895,30908] [2025-04-24 20:40:50,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:40:50,321 INFO L204 MainTranslator]: Completed translation [2025-04-24 20:40:50,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50 WrapperNode [2025-04-24 20:40:50,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 20:40:50,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 20:40:50,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 20:40:50,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 20:40:50,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,364 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-24 20:40:50,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 20:40:50,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 20:40:50,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 20:40:50,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 20:40:50,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 20:40:50,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 20:40:50,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 20:40:50,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 20:40:50,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (1/1) ... [2025-04-24 20:40:50,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:40:50,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:40:50,436 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 20:40:50,439 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 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-24 20:40:50,457 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-24 20:40:50,457 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-24 20:40:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 20:40:50,458 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-24 20:40:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 20:40:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 20:40:50,462 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 20:40:50,569 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 20:40:50,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 20:40:50,760 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 20:40:50,760 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 20:40:50,934 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 20:40:50,935 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 20:40:50,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:40:50 BoogieIcfgContainer [2025-04-24 20:40:50,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 20:40:50,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 20:40:50,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 20:40:50,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 20:40:50,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 08:40:49" (1/3) ... [2025-04-24 20:40:50,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2866e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:40:50, skipping insertion in model container [2025-04-24 20:40:50,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:40:50" (2/3) ... [2025-04-24 20:40:50,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2866e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:40:50, skipping insertion in model container [2025-04-24 20:40:50,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:40:50" (3/3) ... [2025-04-24 20:40:50,944 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-04-24 20:40:50,953 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 20:40:50,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 35 locations, 39 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-24 20:40:50,955 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 20:40:50,998 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 20:40:51,027 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:40:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 20:40:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:40:51,029 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 20:40:51,030 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 20:40:51,085 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:40:51,108 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2025-04-24 20:40:51,113 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;@36754956, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:40:51,113 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 20:40:53,464 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:53,464 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:53,464 INFO L139 ounterexampleChecker]: Examining path program with hash -1793029720, occurence #1 [2025-04-24 20:40:53,464 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:53,464 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:53,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1548680934, now seen corresponding path program 1 times [2025-04-24 20:40:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:53,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595186185] [2025-04-24 20:40:53,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:53,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 20:40:53,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 20:40:53,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:53,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:53,720 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 20:40:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:53,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595186185] [2025-04-24 20:40:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595186185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:53,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:53,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923330854] [2025-04-24 20:40:53,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:53,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:53,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:53,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:53,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:53,739 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:53,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 20:40:53,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:53,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:53,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 20:40:53,851 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:53,852 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:53,852 INFO L139 ounterexampleChecker]: Examining path program with hash -1790116870, occurence #1 [2025-04-24 20:40:53,852 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:53,852 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:53,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1379151932, now seen corresponding path program 1 times [2025-04-24 20:40:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:53,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118257602] [2025-04-24 20:40:53,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:53,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-24 20:40:53,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-24 20:40:53,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 20:40:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:53,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118257602] [2025-04-24 20:40:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118257602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:53,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:53,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:53,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711804740] [2025-04-24 20:40:53,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:53,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:53,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:53,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:53,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:53,964 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:53,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 20:40:53,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:53,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:54,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 20:40:54,029 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:54,029 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:54,029 INFO L139 ounterexampleChecker]: Examining path program with hash 362034472, occurence #1 [2025-04-24 20:40:54,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:54,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:54,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash -392099314, now seen corresponding path program 1 times [2025-04-24 20:40:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:54,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071165604] [2025-04-24 20:40:54,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:54,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:54,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 20:40:54,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 20:40:54,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:54,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:54,164 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 20:40:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:54,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071165604] [2025-04-24 20:40:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071165604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825458571] [2025-04-24 20:40:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:54,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 20:40:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:54,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 20:40:54,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 20:40:54,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:54,167 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:54,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:40:54,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:54,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:40:54,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 20:40:54,560 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:54,561 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:54,562 INFO L139 ounterexampleChecker]: Examining path program with hash 946652219, occurence #1 [2025-04-24 20:40:54,562 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:54,562 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:54,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1998707563, now seen corresponding path program 1 times [2025-04-24 20:40:54,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:54,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807200390] [2025-04-24 20:40:54,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:54,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-24 20:40:54,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-24 20:40:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:54,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:54,813 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 20:40:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:54,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807200390] [2025-04-24 20:40:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807200390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 20:40:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644696273] [2025-04-24 20:40:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:54,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 20:40:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 20:40:54,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 20:40:54,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:54,816 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:54,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 20:40:54,816 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,816 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:54,816 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:40:54,816 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:58,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:58,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:58,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:40:58,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:58,708 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 20:40:58,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 20:40:58,714 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 20:40:58,714 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2025-04-24 20:40:58,716 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:40:58,717 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:40:58,717 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 20:40:58,717 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;@36754956, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:40:58,717 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 20:40:58,719 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 20:40:58,719 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 20:40:58,720 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 20:40:58,720 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-04-24 20:40:58,721 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:40:58,722 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:40:58,722 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2025-04-24 20:40:58,722 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;@36754956, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:40:58,722 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 20:40:58,755 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:58,756 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:58,756 INFO L139 ounterexampleChecker]: Examining path program with hash 883996445, occurence #1 [2025-04-24 20:40:58,756 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:58,756 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:58,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash -750967493, now seen corresponding path program 1 times [2025-04-24 20:40:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:58,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843330417] [2025-04-24 20:40:58,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:58,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-24 20:40:58,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-24 20:40:58,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:58,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:58,806 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 20:40:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:58,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843330417] [2025-04-24 20:40:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843330417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 20:40:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554436264] [2025-04-24 20:40:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:58,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:58,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:58,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:58,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:58,807 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:58,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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-24 20:40:58,807 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:58,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:58,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 20:40:58,926 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:58,926 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:58,926 INFO L139 ounterexampleChecker]: Examining path program with hash 1795217938, occurence #1 [2025-04-24 20:40:58,926 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:58,926 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:58,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2001839249, now seen corresponding path program 1 times [2025-04-24 20:40:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:58,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286536421] [2025-04-24 20:40:58,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:58,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 20:40:58,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 20:40:58,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-24 20:40:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:59,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286536421] [2025-04-24 20:40:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286536421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:59,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725795543] [2025-04-24 20:40:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:59,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:59,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:59,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:59,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,022 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:59,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:40:59,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 20:40:59,072 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:59,072 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:59,073 INFO L139 ounterexampleChecker]: Examining path program with hash 1232465491, occurence #1 [2025-04-24 20:40:59,073 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:59,073 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:59,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1674042637, now seen corresponding path program 1 times [2025-04-24 20:40:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:59,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552316804] [2025-04-24 20:40:59,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:59,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-24 20:40:59,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-24 20:40:59,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 20:40:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:59,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552316804] [2025-04-24 20:40:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552316804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:59,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8438759] [2025-04-24 20:40:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:59,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:59,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:59,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:59,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,130 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:59,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:40:59,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 20:40:59,193 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:59,193 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:59,193 INFO L139 ounterexampleChecker]: Examining path program with hash -1718204237, occurence #1 [2025-04-24 20:40:59,193 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:59,193 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:59,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1942098077, now seen corresponding path program 1 times [2025-04-24 20:40:59,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:59,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783114796] [2025-04-24 20:40:59,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:59,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:59,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-24 20:40:59,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-24 20:40:59,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:59,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 20:40:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:59,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783114796] [2025-04-24 20:40:59,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783114796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:59,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:59,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487373761] [2025-04-24 20:40:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:59,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:59,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:59,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:59,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,245 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:59,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 20:40:59,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 20:40:59,287 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:59,287 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:59,287 INFO L139 ounterexampleChecker]: Examining path program with hash -1343505435, occurence #1 [2025-04-24 20:40:59,287 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:59,287 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:59,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1996154753, now seen corresponding path program 1 times [2025-04-24 20:40:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:59,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134443749] [2025-04-24 20:40:59,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:59,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 20:40:59,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 20:40:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:59,374 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 20:40:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:59,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134443749] [2025-04-24 20:40:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134443749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:59,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 20:40:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835940178] [2025-04-24 20:40:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:59,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:40:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:59,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:40:59,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:40:59,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,376 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:59,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:40:59,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 20:40:59,425 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:59,425 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:59,425 INFO L139 ounterexampleChecker]: Examining path program with hash -481667379, occurence #1 [2025-04-24 20:40:59,425 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:59,426 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:59,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 855261019, now seen corresponding path program 1 times [2025-04-24 20:40:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:59,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084004746] [2025-04-24 20:40:59,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:59,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-24 20:40:59,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-24 20:40:59,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:59,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:40:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:40:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:40:59,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084004746] [2025-04-24 20:40:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084004746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:40:59,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:40:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 20:40:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477803061] [2025-04-24 20:40:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:40:59,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 20:40:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:40:59,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 20:40:59,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 20:40:59,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,529 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:40:59,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 20:40:59,529 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,529 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,529 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,529 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,529 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,529 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:40:59,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:40:59,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-24 20:40:59,578 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:40:59,578 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:40:59,578 INFO L139 ounterexampleChecker]: Examining path program with hash 778069091, occurence #1 [2025-04-24 20:40:59,578 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:40:59,578 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:40:59,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:40:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash -843244296, now seen corresponding path program 1 times [2025-04-24 20:40:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:40:59,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906327683] [2025-04-24 20:40:59,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:40:59,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 20:40:59,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 20:40:59,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:59,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-24 20:40:59,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039508431] [2025-04-24 20:40:59,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:40:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:40:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:40:59,645 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 20:40:59,646 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 20:40:59,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 20:40:59,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 20:40:59,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:40:59,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 20:40:59,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 20:40:59,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 20:41:00,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 20:41:00,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:41:00,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 20:41:00,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 20:41:00,078 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 20:41:00,079 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 20:41:00,088 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 20:41:00,279 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,SelfDestructingSolverStorable10 [2025-04-24 20:41:00,280 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-24 20:41:00,280 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2025-04-24 20:41:00,349 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 20:41:00,349 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 20:41:00,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-24 20:41:00,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 08:41:00 BasicIcfg [2025-04-24 20:41:00,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 20:41:00,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 20:41:00,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 20:41:00,373 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 20:41:00,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:40:50" (3/4) ... [2025-04-24 20:41:00,374 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-24 20:41:00,442 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 30. [2025-04-24 20:41:00,482 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 20:41:00,482 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 20:41:00,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 20:41:00,484 INFO L158 Benchmark]: Toolchain (without parser) took 10524.26ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 67.4MB in the end (delta: 66.4MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2025-04-24 20:41:00,484 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.8MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:41:00,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.39ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 110.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-24 20:41:00,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.80ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:41:00,484 INFO L158 Benchmark]: Boogie Preprocessor took 34.09ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:41:00,485 INFO L158 Benchmark]: RCFGBuilder took 533.42ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 61.4MB in the end (delta: 45.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-04-24 20:41:00,485 INFO L158 Benchmark]: TraceAbstraction took 9435.49ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 83.8MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:41:00,485 INFO L158 Benchmark]: Witness Printer took 109.38ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 67.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 20:41:00,486 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.60ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.8MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.39ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 110.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.80ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.09ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 533.42ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 61.4MB in the end (delta: 45.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9435.49ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 83.8MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 109.38ms. Allocated memory is still 167.8MB. Free memory was 83.8MB in the beginning and 67.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5190, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 494, dependent conditional: 482, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4789, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 93, dependent conditional: 81, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4789, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 93, dependent conditional: 81, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5034, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 338, dependent conditional: 326, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5034, independent: 4696, independent conditional: 2, independent unconditional: 4694, dependent: 338, dependent conditional: 34, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5034, independent: 4696, independent conditional: 2, independent unconditional: 4694, dependent: 338, dependent conditional: 34, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 775, independent: 754, independent conditional: 1, independent unconditional: 753, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 775, independent: 746, independent conditional: 0, independent unconditional: 746, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6335, independent: 1502, independent conditional: 1433, independent unconditional: 69, dependent: 4833, dependent conditional: 2500, dependent unconditional: 2333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 5034, independent: 3942, independent conditional: 1, independent unconditional: 3941, dependent: 317, dependent conditional: 25, dependent unconditional: 292, unknown: 775, unknown conditional: 10, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 754, Positive conditional cache size: 1, Positive unconditional cache size: 753, Negative cache size: 21, Negative conditional cache size: 9, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3921, Maximal queried relation: 4, Independence queries for same thread: 401, Persistent sets #1 benchmarks: Persistent set computation time: 2.5s, Number of persistent set computation: 352, Number of trivial persistent sets: 325, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1077, independent: 1065, independent conditional: 0, independent unconditional: 1065, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5190, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 494, dependent conditional: 482, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4789, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 93, dependent conditional: 81, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4789, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 93, dependent conditional: 81, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5034, independent: 4696, independent conditional: 3631, independent unconditional: 1065, dependent: 338, dependent conditional: 326, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5034, independent: 4696, independent conditional: 2, independent unconditional: 4694, dependent: 338, dependent conditional: 34, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5034, independent: 4696, independent conditional: 2, independent unconditional: 4694, dependent: 338, dependent conditional: 34, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 775, independent: 754, independent conditional: 1, independent unconditional: 753, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 775, independent: 746, independent conditional: 0, independent unconditional: 746, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6335, independent: 1502, independent conditional: 1433, independent unconditional: 69, dependent: 4833, dependent conditional: 2500, dependent unconditional: 2333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 5034, independent: 3942, independent conditional: 1, independent unconditional: 3941, dependent: 317, dependent conditional: 25, dependent unconditional: 292, unknown: 775, unknown conditional: 10, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 754, Positive conditional cache size: 1, Positive unconditional cache size: 753, Negative cache size: 21, Negative conditional cache size: 9, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3921, Maximal queried relation: 4, Independence queries for same thread: 401 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 173, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 171, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 756, Positive conditional cache size: 0, Positive unconditional cache size: 756, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, 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: 6, Number of trivial persistent sets: 4, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 173, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 171, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 756, Positive conditional cache size: 0, Positive unconditional cache size: 756, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1994, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 242, dependent conditional: 228, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 61, dependent conditional: 47, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 34, dependent conditional: 21, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1813, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 57, dependent conditional: 9, dependent unconditional: 48, unknown: 30, unknown conditional: 2, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 782, Positive conditional cache size: 0, Positive unconditional cache size: 782, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 883, Maximal queried relation: 4, Independence queries for same thread: 213, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 126, Number of trivial persistent sets: 108, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 919, independent: 905, independent conditional: 0, independent unconditional: 905, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1994, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 242, dependent conditional: 228, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 61, dependent conditional: 47, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 34, dependent conditional: 21, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1813, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 57, dependent conditional: 9, dependent unconditional: 48, unknown: 30, unknown conditional: 2, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 782, Positive conditional cache size: 0, Positive unconditional cache size: 782, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 883, Maximal queried relation: 4, Independence queries for same thread: 213 - PositiveResult [Line: 713]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\at(b, Pre)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND TRUE 2 removeLogElement()==i [L747] 2 receive=0 [L748] 2 send=1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=0, send=1] [L740] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\at(b, Pre)=1, b=1, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=2, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] 2 reach_error() VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=2, m={4:0}, next=2, receive=1, send=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 63 locations, 76 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 6.8s, 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: 13, 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.5s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 12/12 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: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 63 locations, 76 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: 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: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 63 locations, 76 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, 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: 18, 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.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 37/37 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 proved your program to be incorrect! [2025-04-24 20:41:00,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE