./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c -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 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 17:47:24,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 17:47:24,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 17:47:24,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 17:47:24,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 17:47:24,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 17:47:24,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 17:47:24,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 17:47:24,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 17:47:24,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 17:47:24,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 17:47:24,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 17:47:24,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 17:47:24,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 17:47:24,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:47:24,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:47:24,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:47:24,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 17:47:24,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 17:47:24,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 17:47:24,472 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 17:47:24,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 17:47:24,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 17:47:24,472 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 17:47:24,472 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 17:47:24,472 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 -> 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 [2025-04-24 17:47:24,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 17:47:24,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 17:47:24,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 17:47:24,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 17:47:24,755 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 17:47:24,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-04-24 17:47:26,082 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3644079db/5a5f29a6c99e4a49bace9418b865e1c4/FLAG81b9b2d3f [2025-04-24 17:47:26,261 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 17:47:26,264 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-04-24 17:47:26,270 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3644079db/5a5f29a6c99e4a49bace9418b865e1c4/FLAG81b9b2d3f [2025-04-24 17:47:27,132 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3644079db/5a5f29a6c99e4a49bace9418b865e1c4 [2025-04-24 17:47:27,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 17:47:27,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 17:47:27,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 17:47:27,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 17:47:27,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 17:47:27,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b000c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27, skipping insertion in model container [2025-04-24 17:47:27,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 17:47:27,279 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/weaver/popl20-simple-queue.wvr.c[2464,2477] [2025-04-24 17:47:27,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:47:27,298 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 17:47:27,317 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/weaver/popl20-simple-queue.wvr.c[2464,2477] [2025-04-24 17:47:27,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:47:27,329 INFO L204 MainTranslator]: Completed translation [2025-04-24 17:47:27,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27 WrapperNode [2025-04-24 17:47:27,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 17:47:27,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 17:47:27,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 17:47:27,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 17:47:27,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,358 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 120 [2025-04-24 17:47:27,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 17:47:27,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 17:47:27,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 17:47:27,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 17:47:27,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 17:47:27,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 17:47:27,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 17:47:27,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 17:47:27,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (1/1) ... [2025-04-24 17:47:27,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:47:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:27,425 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 17:47:27,428 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 17:47:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 17:47:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 17:47:27,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 17:47:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 17:47:27,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 17:47:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 17:47:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 17:47:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-24 17:47:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-24 17:47:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 17:47:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 17:47:27,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 17:47:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 17:47:27,450 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 17:47:27,521 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 17:47:27,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 17:47:27,661 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 17:47:27,662 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 17:47:27,780 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 17:47:27,783 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-24 17:47:27,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:47:27 BoogieIcfgContainer [2025-04-24 17:47:27,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 17:47:27,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 17:47:27,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 17:47:27,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 17:47:27,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 05:47:27" (1/3) ... [2025-04-24 17:47:27,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d16754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:47:27, skipping insertion in model container [2025-04-24 17:47:27,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:47:27" (2/3) ... [2025-04-24 17:47:27,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d16754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:47:27, skipping insertion in model container [2025-04-24 17:47:27,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:47:27" (3/3) ... [2025-04-24 17:47:27,792 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-04-24 17:47:27,801 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 17:47:27,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 24 locations, 26 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-24 17:47:27,803 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 17:47:27,844 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 17:47:27,883 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:47:27,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 17:47:27,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:27,885 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 17:47:27,887 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 17:47:27,936 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 17:47:27,948 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 17:47:27,953 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;@46c7ab39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:47:27,953 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-24 17:47:28,020 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:28,020 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:28,021 INFO L139 ounterexampleChecker]: Examining path program with hash 1029206324, occurence #1 [2025-04-24 17:47:28,021 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:28,021 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:28,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1168062473, now seen corresponding path program 1 times [2025-04-24 17:47:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:28,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171649977] [2025-04-24 17:47:28,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:28,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-24 17:47:28,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-24 17:47:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:28,143 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 17:47:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:28,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171649977] [2025-04-24 17:47:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171649977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:28,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:28,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 17:47:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699736828] [2025-04-24 17:47:28,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:28,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 17:47:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:28,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 17:47:28,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 17:47:28,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,163 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:28,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:47:28,164 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 17:47:28,235 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:28,235 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:28,235 INFO L139 ounterexampleChecker]: Examining path program with hash -2027273826, occurence #1 [2025-04-24 17:47:28,235 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:28,235 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:28,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash -698041065, now seen corresponding path program 1 times [2025-04-24 17:47:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:28,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168100302] [2025-04-24 17:47:28,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:28,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 17:47:28,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 17:47:28,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:28,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:28,356 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 17:47:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:28,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168100302] [2025-04-24 17:47:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168100302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:28,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:28,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 17:47:28,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432294319] [2025-04-24 17:47:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:28,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 17:47:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:28,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 17:47:28,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 17:47:28,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,359 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:28,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:47:28,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:28,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 17:47:28,396 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:28,396 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:28,396 INFO L139 ounterexampleChecker]: Examining path program with hash 2094793067, occurence #1 [2025-04-24 17:47:28,396 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:28,396 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:28,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -424765072, now seen corresponding path program 1 times [2025-04-24 17:47:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:28,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097102802] [2025-04-24 17:47:28,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 17:47:28,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 17:47:28,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:28,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:47:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:28,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097102802] [2025-04-24 17:47:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097102802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:28,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 17:47:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682976831] [2025-04-24 17:47:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:28,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 17:47:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:28,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 17:47:28,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 17:47:28,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,586 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:28,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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 17:47:28,586 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,586 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:28,586 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:28,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:28,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:28,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 17:47:28,629 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:28,629 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:28,629 INFO L139 ounterexampleChecker]: Examining path program with hash 2094793067, occurence #2 [2025-04-24 17:47:28,629 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:47:28,629 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:47:28,630 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:28,630 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 17:47:28,633 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:28,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 17:47:28,633 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:28,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 17:47:28,633 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:28,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 17:47:28,634 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:28,634 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-24 17:47:28,634 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:28,634 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 17:47:28,634 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:28,634 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:47:28,634 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:28,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2118493642, now seen corresponding path program 1 times [2025-04-24 17:47:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:28,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013793996] [2025-04-24 17:47:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:28,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 17:47:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:47:28,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:28,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:28,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013793996] [2025-04-24 17:47:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013793996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:47:28,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670500668] [2025-04-24 17:47:28,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:28,819 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 17:47:28,820 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 17:47:28,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 17:47:28,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:47:28,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:28,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:47:28,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:47:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:28,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:47:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670500668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:47:29,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:47:29,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-24 17:47:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822784663] [2025-04-24 17:47:29,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:47:29,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-24 17:47:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-24 17:47:29,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-24 17:47:29,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:29,088 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:29,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:47:29,088 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:29,088 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:29,089 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:29,089 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:29,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:29,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:29,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:29,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:29,171 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 17:47:29,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:29,367 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:29,367 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:29,367 INFO L139 ounterexampleChecker]: Examining path program with hash 2094793067, occurence #3 [2025-04-24 17:47:29,367 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:47:29,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:47:29,367 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:29,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 17:47:29,368 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:29,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:47:29,368 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:29,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 17:47:29,368 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:29,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 17:47:29,368 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:29,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:47:29,368 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:29,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-24 17:47:29,368 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:29,368 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:47:29,368 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:29,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1210495536, now seen corresponding path program 2 times [2025-04-24 17:47:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:29,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851884317] [2025-04-24 17:47:29,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:47:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:29,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 17:47:29,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 17:47:29,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:47:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:29,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851884317] [2025-04-24 17:47:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851884317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:47:29,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720413431] [2025-04-24 17:47:29,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:47:29,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:29,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:47:29,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 17:47:29,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 17:47:29,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 17:47:29,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:47:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:29,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-24 17:47:29,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:47:30,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-24 17:47:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:30,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:47:30,234 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-24 17:47:30,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-04-24 17:47:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720413431] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:47:30,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:47:30,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-24 17:47:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324655034] [2025-04-24 17:47:30,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:47:30,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-24 17:47:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-24 17:47:30,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-04-24 17:47:30,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:30,427 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:30,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 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 17:47:30,427 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:30,427 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:30,427 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:30,427 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:30,427 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:30,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:30,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:30,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:30,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:30,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:30,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 17:47:30,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:30,935 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:30,935 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:30,936 INFO L139 ounterexampleChecker]: Examining path program with hash 2094793067, occurence #4 [2025-04-24 17:47:30,936 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:47:30,936 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-24 17:47:30,936 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-24 17:47:30,936 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-24 17:47:30,936 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 17:47:30,936 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-24 17:47:30,936 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:30,936 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 34 [2025-04-24 17:47:30,936 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:30,936 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:47:30,936 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:30,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 622473871, now seen corresponding path program 3 times [2025-04-24 17:47:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:30,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322391564] [2025-04-24 17:47:30,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:47:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:30,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-04-24 17:47:30,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 17:47:30,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-24 17:47:30,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:31,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322391564] [2025-04-24 17:47:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322391564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:47:31,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109028339] [2025-04-24 17:47:31,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:47:31,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:31,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:47:31,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 17:47:31,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-04-24 17:47:31,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 17:47:31,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-24 17:47:31,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:31,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-24 17:47:31,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:47:31,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:47:31,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-04-24 17:47:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:31,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:47:31,674 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-24 17:47:31,675 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-04-24 17:47:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:47:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109028339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:47:31,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:47:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-24 17:47:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861775592] [2025-04-24 17:47:31,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:47:31,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-24 17:47:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:31,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-24 17:47:31,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-04-24 17:47:31,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:31,797 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:31,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 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 17:47:31,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:31,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:31,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:31,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:31,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:31,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:32,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:32,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:32,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:32,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:32,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:32,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:32,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-24 17:47:32,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:32,206 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:32,206 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:32,206 INFO L139 ounterexampleChecker]: Examining path program with hash 2094793067, occurence #5 [2025-04-24 17:47:32,206 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:47:32,206 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:47:32,206 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:32,206 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 17:47:32,206 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:32,206 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-24 17:47:32,207 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:32,207 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-24 17:47:32,207 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:32,207 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-24 17:47:32,207 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:32,207 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-24 17:47:32,207 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:32,207 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-24 17:47:32,207 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:32,207 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:47:32,207 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:32,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash -871108471, now seen corresponding path program 4 times [2025-04-24 17:47:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:32,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029711502] [2025-04-24 17:47:32,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 17:47:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:32,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-24 17:47:32,231 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-24 17:47:32,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 17:47:32,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-24 17:47:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:32,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029711502] [2025-04-24 17:47:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029711502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:47:32,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997629798] [2025-04-24 17:47:32,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 17:47:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:32,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:47:32,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 17:47:32,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-24 17:47:32,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-24 17:47:32,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 17:47:32,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:32,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-24 17:47:32,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:47:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:47:32,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:47:32,485 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-24 17:47:32,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-04-24 17:47:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-24 17:47:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997629798] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:47:32,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:47:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 9 [2025-04-24 17:47:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752183359] [2025-04-24 17:47:32,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:47:32,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-24 17:47:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:32,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-24 17:47:32,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-24 17:47:32,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:32,505 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:32,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:32,505 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:32,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 17:47:32,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-24 17:47:32,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-24 17:47:32,828 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:32,828 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:32,828 INFO L139 ounterexampleChecker]: Examining path program with hash 1546793548, occurence #1 [2025-04-24 17:47:32,829 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:47:32,829 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:47:32,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2115008667, now seen corresponding path program 5 times [2025-04-24 17:47:32,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:47:32,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759894646] [2025-04-24 17:47:32,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 17:47:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:32,836 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 5 equivalence classes. [2025-04-24 17:47:32,847 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-04-24 17:47:32,847 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-24 17:47:32,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:47:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:47:33,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759894646] [2025-04-24 17:47:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759894646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:47:33,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726006233] [2025-04-24 17:47:33,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 17:47:33,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:47:33,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:47:33,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 17:47:33,081 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 5 equivalence classes. [2025-04-24 17:47:33,118 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-04-24 17:47:33,118 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-24 17:47:33,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:33,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-24 17:47:33,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:47:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:47:33,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:47:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:47:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726006233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:47:33,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:47:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-04-24 17:47:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40418083] [2025-04-24 17:47:33,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:47:33,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-24 17:47:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:47:33,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-24 17:47:33,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=877, Unknown=0, NotChecked=0, Total=1190 [2025-04-24 17:47:33,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:33,635 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:33,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.5142857142857142) internal successors, (123), 34 states have internal predecessors, (123), 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 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 17:47:33,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:33,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:33,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:33,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:33,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:33,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:33,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:33,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 17:47:33,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:33,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-24 17:47:34,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:47:34,034 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 17:47:34,034 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:47:34,035 INFO L139 ounterexampleChecker]: Examining path program with hash 1546793548, occurence #2 [2025-04-24 17:47:34,035 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:47:34,035 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:47:34,035 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:34,035 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:47:34,035 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:34,035 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:47:34,035 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:47:34,035 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-24 17:47:34,035 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:47:34,035 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-24 17:47:34,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:47:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1558036707, now seen corresponding path program 1 times [2025-04-24 17:47:34,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-24 17:47:34,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167687939] [2025-04-24 17:47:34,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:47:34,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:47:34,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-24 17:47:34,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 17:47:34,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:47:34,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:47:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 17:47:34,105 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-24 17:47:34,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167687939] [2025-04-24 17:47:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167687939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:47:34,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:47:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 17:47:34,107 INFO L172 ounterexampleChecker]: Successfully proved commutativity at non-minimality point 35. Constructing proof automaton... [2025-04-24 17:47:34,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:47:34,107 INFO L311 artialOrderCegarLoop]: Commutativity proof succeeded, skipping feasibility check. [2025-04-24 17:47:34,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 17:47:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SMTINTERPOL [2025-04-24 17:47:34,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:47:34,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:47:34,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:34,108 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:47:34,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 17:47:34,108 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:34,108 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:34,108 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:34,108 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:47:34,109 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:34,109 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:47:34,109 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 17:47:34,109 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:47:34,109 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-24 17:47:35,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 17:47:35,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-24 17:47:35,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:47:35,564 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-24 17:47:35,565 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-24 17:47:35,565 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-24 17:47:35,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 17:47:35,568 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-04-24 17:47:35,570 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 17:47:35,570 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 17:47:35,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-24 17:47:35,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 05:47:35 BasicIcfg [2025-04-24 17:47:35,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 17:47:35,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 17:47:35,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 17:47:35,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 17:47:35,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:47:27" (3/4) ... [2025-04-24 17:47:35,581 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-24 17:47:35,583 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-04-24 17:47:35,583 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-04-24 17:47:35,585 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2025-04-24 17:47:35,586 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-04-24 17:47:35,586 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-24 17:47:35,586 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-24 17:47:35,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 17:47:35,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 17:47:35,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 17:47:35,643 INFO L158 Benchmark]: Toolchain (without parser) took 8508.10ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 92.1MB in the beginning and 104.4MB in the end (delta: -12.3MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2025-04-24 17:47:35,644 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:47:35,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.20ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 78.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 17:47:35,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.88ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:47:35,645 INFO L158 Benchmark]: Boogie Preprocessor took 31.83ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 75.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:47:35,645 INFO L158 Benchmark]: RCFGBuilder took 388.88ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 43.3MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-24 17:47:35,646 INFO L158 Benchmark]: TraceAbstraction took 7792.55ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 42.6MB in the beginning and 110.8MB in the end (delta: -68.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:47:35,646 INFO L158 Benchmark]: Witness Printer took 63.55ms. Allocated memory is still 176.2MB. Free memory was 110.8MB in the beginning and 104.4MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-24 17:47:35,648 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.20ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 78.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.88ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.83ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 75.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.88ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 43.3MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7792.55ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 42.6MB in the beginning and 110.8MB in the end (delta: -68.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.55ms. Allocated memory is still 176.2MB. Free memory was 110.8MB in the beginning and 104.4MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4467, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 1365, dependent conditional: 1362, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3116, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3116, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3177, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 75, dependent conditional: 72, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3177, independent: 3102, independent conditional: 50, independent unconditional: 3052, dependent: 75, dependent conditional: 3, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3177, independent: 3102, independent conditional: 50, independent unconditional: 3052, dependent: 75, dependent conditional: 3, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 269, independent: 265, independent conditional: 3, independent unconditional: 262, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 269, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 49, independent conditional: 5, independent unconditional: 44, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3177, independent: 2837, independent conditional: 47, independent unconditional: 2790, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 269, unknown conditional: 4, unknown unconditional: 265] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 266, Positive conditional cache size: 4, Positive unconditional cache size: 262, Negative cache size: 4, Negative conditional cache size: 1, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2794, Maximal queried relation: 1, Independence queries for same thread: 1351, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 81, Number of trivial persistent sets: 66, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 330, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4467, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 1365, dependent conditional: 1362, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3116, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3116, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3177, independent: 3102, independent conditional: 2775, independent unconditional: 327, dependent: 75, dependent conditional: 72, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3177, independent: 3102, independent conditional: 50, independent unconditional: 3052, dependent: 75, dependent conditional: 3, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3177, independent: 3102, independent conditional: 50, independent unconditional: 3052, dependent: 75, dependent conditional: 3, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 269, independent: 265, independent conditional: 3, independent unconditional: 262, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 269, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 49, independent conditional: 5, independent unconditional: 44, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3177, independent: 2837, independent conditional: 47, independent unconditional: 2790, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 269, unknown conditional: 4, unknown unconditional: 265] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 266, Positive conditional cache size: 4, Positive unconditional cache size: 262, Negative cache size: 4, Negative conditional cache size: 1, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2794, Maximal queried relation: 1, Independence queries for same thread: 1351 - PositiveResult [Line: 86]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 38 locations, 46 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 2.6s, 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: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 601 ConstructedInterpolants, 0 QuantifiedInterpolants, 3578 SizeOfPredicates, 30 NumberOfNonLiveVariables, 913 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 211/407 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: 1, ConComChecker Statistics: CheckTime [ms]: 75, ConditionCalculationTime [ms]: 10, ConditionCalculations: 19, QuantifiedConditions: 0, TraceChecks: 1, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-24 17:47:35,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE