./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 20:19:33,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 20:19:33,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 20:19:33,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 20:19:33,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 20:19:33,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 20:19:33,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 20:19:33,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 20:19:33,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 20:19:33,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 20:19:33,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 20:19:33,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 20:19:33,397 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 20:19:33,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 20:19:33,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:19:33,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:19:33,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:19:33,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 20:19:33,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 20:19:33,400 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 20:19:33,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 20:19:33,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 20:19:33,400 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 20:19:33,400 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 20:19:33,400 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-04-24 20:19:33,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 20:19:33,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 20:19:33,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 20:19:33,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 20:19:33,591 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 20:19:33,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-04-24 20:19:34,896 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e73f5287b/0d0f7c2cd54546c7b1e5414a44fc1e9c/FLAGc409cef13 [2025-04-24 20:19:35,103 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 20:19:35,103 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-04-24 20:19:35,116 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e73f5287b/0d0f7c2cd54546c7b1e5414a44fc1e9c/FLAGc409cef13 [2025-04-24 20:19:36,097 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e73f5287b/0d0f7c2cd54546c7b1e5414a44fc1e9c [2025-04-24 20:19:36,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 20:19:36,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 20:19:36,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 20:19:36,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 20:19:36,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 20:19:36,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e31cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36, skipping insertion in model container [2025-04-24 20:19:36,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 20:19:36,291 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-more-multiply-verify.wvr.c[3081,3094] [2025-04-24 20:19:36,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:19:36,311 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 20:19:36,347 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-more-multiply-verify.wvr.c[3081,3094] [2025-04-24 20:19:36,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:19:36,363 INFO L204 MainTranslator]: Completed translation [2025-04-24 20:19:36,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36 WrapperNode [2025-04-24 20:19:36,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 20:19:36,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 20:19:36,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 20:19:36,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 20:19:36,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,399 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 162 [2025-04-24 20:19:36,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 20:19:36,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 20:19:36,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 20:19:36,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 20:19:36,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 20:19:36,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 20:19:36,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 20:19:36,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 20:19:36,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (1/1) ... [2025-04-24 20:19:36,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:19:36,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:36,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 20:19:36,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 20:19:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 20:19:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 20:19:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 20:19:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 20:19:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 20:19:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 20:19:36,473 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 20:19:36,544 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 20:19:36,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 20:19:36,725 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 20:19:36,725 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 20:19:36,886 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 20:19:36,886 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 20:19:36,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:19:36 BoogieIcfgContainer [2025-04-24 20:19:36,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 20:19:36,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 20:19:36,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 20:19:36,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 20:19:36,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 08:19:36" (1/3) ... [2025-04-24 20:19:36,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d454453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:19:36, skipping insertion in model container [2025-04-24 20:19:36,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:19:36" (2/3) ... [2025-04-24 20:19:36,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d454453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:19:36, skipping insertion in model container [2025-04-24 20:19:36,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:19:36" (3/3) ... [2025-04-24 20:19:36,898 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-04-24 20:19:36,909 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 20:19:36,911 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 33 locations, 32 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-24 20:19:36,911 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 20:19:36,961 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 20:19:36,994 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:19:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 20:19:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:36,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 20:19:36,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 20:19:37,051 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:19:37,065 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 20:19:37,072 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;@1bc69a1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:19:37,073 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 20:19:37,375 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:37,376 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:37,376 INFO L139 ounterexampleChecker]: Examining path program with hash -1985120011, occurence #1 [2025-04-24 20:19:37,376 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:19:37,376 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:37,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 35637497, now seen corresponding path program 1 times [2025-04-24 20:19:37,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:37,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622372109] [2025-04-24 20:19:37,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:37,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:19:37,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:19:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:37,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622372109] [2025-04-24 20:19:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622372109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:19:37,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:19:37,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 20:19:37,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627977595] [2025-04-24 20:19:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:19:37,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 20:19:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:37,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 20:19:37,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 20:19:37,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:37,642 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:37,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:37,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:37,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:37,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 20:19:37,779 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:37,779 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:37,779 INFO L139 ounterexampleChecker]: Examining path program with hash 552738941, occurence #1 [2025-04-24 20:19:37,779 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:19:37,779 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:37,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1479608347, now seen corresponding path program 2 times [2025-04-24 20:19:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:37,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018028135] [2025-04-24 20:19:37,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:19:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:37,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-24 20:19:37,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 20:19:37,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 20:19:37,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:38,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018028135] [2025-04-24 20:19:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018028135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:19:38,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:19:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 20:19:38,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338330051] [2025-04-24 20:19:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:19:38,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:19:38,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:38,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:19:38,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 20:19:38,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:38,007 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:38,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:38,007 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:38,007 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:38,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:38,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:38,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 20:19:38,081 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:38,081 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:38,082 INFO L139 ounterexampleChecker]: Examining path program with hash 552738941, occurence #2 [2025-04-24 20:19:38,082 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:19:38,082 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 20:19:38,091 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:38,092 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 20:19:38,092 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:38,092 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-24 20:19:38,092 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:38,092 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 20:19:38,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1658303513, now seen corresponding path program 1 times [2025-04-24 20:19:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-24 20:19:38,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329728263] [2025-04-24 20:19:38,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:38,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-24 20:19:38,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 20:19:38,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:38,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:38,247 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-24 20:19:38,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329728263] [2025-04-24 20:19:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329728263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:38,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1104408576] [2025-04-24 20:19:38,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:38,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-24 20:19:38,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 20:19:38,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:38,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:38,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:19:38,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1104408576] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:38,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:19:38,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2025-04-24 20:19:38,356 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-24 20:19:38,356 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 20:19:38,358 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:38,358 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 20:19:38,358 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:19:38,358 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:19:38,358 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:38,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2085046429, now seen corresponding path program 1 times [2025-04-24 20:19:38,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:38,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671733363] [2025-04-24 20:19:38,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 20:19:38,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:19:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:38,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:38,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671733363] [2025-04-24 20:19:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671733363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:38,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46106397] [2025-04-24 20:19:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:38,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:38,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:19:38,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 20:19:38,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 20:19:38,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 20:19:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:38,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 20:19:38,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:38,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:19:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46106397] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:19:38,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:19:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-24 20:19:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781223662] [2025-04-24 20:19:38,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:19:38,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-24 20:19:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:38,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-24 20:19:38,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-24 20:19:38,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:38,717 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:38,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:38,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:38,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:38,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:38,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:38,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:38,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:38,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 20:19:39,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-24 20:19:39,002 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:39,002 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:39,003 INFO L139 ounterexampleChecker]: Examining path program with hash 552738941, occurence #3 [2025-04-24 20:19:39,003 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:19:39,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 20:19:39,003 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:39,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:19:39,003 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:39,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 20:19:39,003 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:39,003 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 20:19:39,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1860753964, now seen corresponding path program 1 times [2025-04-24 20:19:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-24 20:19:39,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884027907] [2025-04-24 20:19:39,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:39,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 20:19:39,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 20:19:39,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:39,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:19:39,165 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-24 20:19:39,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884027907] [2025-04-24 20:19:39,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884027907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:19:39,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:19:39,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-24 20:19:39,167 INFO L172 ounterexampleChecker]: Successfully proved commutativity at non-minimality point 20. Constructing proof automaton... [2025-04-24 20:19:39,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:19:39,168 INFO L311 artialOrderCegarLoop]: Commutativity proof succeeded, skipping feasibility check. [2025-04-24 20:19:39,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 20:19:39,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SMTINTERPOL [2025-04-24 20:19:39,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 20:19:39,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 20:19:39,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:39,169 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:39,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:39,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:39,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:39,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:39,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:39,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:39,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:39,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:39,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:39,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 20:19:39,266 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:39,266 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:39,266 INFO L139 ounterexampleChecker]: Examining path program with hash 1408605775, occurence #1 [2025-04-24 20:19:39,266 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:19:39,266 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:39,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1513657534, now seen corresponding path program 1 times [2025-04-24 20:19:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:39,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685677522] [2025-04-24 20:19:39,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:39,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 20:19:39,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 20:19:39,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:39,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:19:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:39,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685677522] [2025-04-24 20:19:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685677522] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:39,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497131346] [2025-04-24 20:19:39,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:39,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:39,437 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 20:19:39,437 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 20:19:39,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 20:19:39,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 20:19:39,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:39,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:39,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 20:19:39,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:19:39,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:19:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 20:19:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497131346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:19:39,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:19:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-24 20:19:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136695171] [2025-04-24 20:19:39,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:19:39,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-24 20:19:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:39,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-24 20:19:39,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-24 20:19:39,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:39,719 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:39,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:39,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:39,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:39,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:39,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:39,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:40,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:40,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:40,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:40,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:40,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:40,131 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 20:19:40,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:40,329 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:40,329 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:40,330 INFO L139 ounterexampleChecker]: Examining path program with hash 932353203, occurence #1 [2025-04-24 20:19:40,330 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:19:40,330 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:40,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1193111402, now seen corresponding path program 2 times [2025-04-24 20:19:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:40,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132380865] [2025-04-24 20:19:40,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:19:40,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:40,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-24 20:19:40,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-24 20:19:40,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:19:40,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-24 20:19:41,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:41,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132380865] [2025-04-24 20:19:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132380865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:41,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278192219] [2025-04-24 20:19:41,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:19:41,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:41,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:41,731 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 20:19:41,733 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 20:19:41,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-24 20:19:41,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-24 20:19:41,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:19:41,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:41,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-24 20:19:41,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:41,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-24 20:19:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:42,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:19:43,835 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 78 treesize of output 70 [2025-04-24 20:19:43,870 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-24 20:19:43,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 142 [2025-04-24 20:19:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:19:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278192219] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:19:44,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:19:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 44 [2025-04-24 20:19:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807995315] [2025-04-24 20:19:44,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:19:44,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-24 20:19:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:44,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-24 20:19:44,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2025-04-24 20:19:44,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:44,134 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:44,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 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 20:19:44,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:44,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:44,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:44,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:44,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:44,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:45,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:45,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:45,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:45,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:45,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:45,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:19:45,602 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 20:19:45,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:45,797 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:45,797 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:45,798 INFO L139 ounterexampleChecker]: Examining path program with hash 932353203, occurence #2 [2025-04-24 20:19:45,798 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:19:45,798 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-24 20:19:45,798 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:45,798 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-24 20:19:45,798 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:45,798 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-24 20:19:45,798 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:45,798 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-24 20:19:45,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 612480180, now seen corresponding path program 1 times [2025-04-24 20:19:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-24 20:19:45,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707171192] [2025-04-24 20:19:45,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:45,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-24 20:19:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-24 20:19:45,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:45,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 20:19:45,845 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-24 20:19:45,845 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-24 20:19:45,845 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 44 [2025-04-24 20:19:45,845 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:45,847 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 46 [2025-04-24 20:19:45,847 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:19:45,847 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:19:45,847 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:45,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2086878870, now seen corresponding path program 3 times [2025-04-24 20:19:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:45,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862884048] [2025-04-24 20:19:45,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:19:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:45,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes. [2025-04-24 20:19:45,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 20:19:45,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-24 20:19:45,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-24 20:19:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:46,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862884048] [2025-04-24 20:19:46,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862884048] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:46,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139078737] [2025-04-24 20:19:46,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:19:46,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:46,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:46,512 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 20:19:46,514 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 20:19:46,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes. [2025-04-24 20:19:46,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 20:19:46,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-24 20:19:46,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:46,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-24 20:19:46,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 20:19:47,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:19:47,122 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 20:19:47,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-04-24 20:19:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-24 20:19:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139078737] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:19:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 18] total 28 [2025-04-24 20:19:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301745909] [2025-04-24 20:19:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:19:47,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-24 20:19:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:47,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-24 20:19:47,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-04-24 20:19:47,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:47,564 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:47,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:19:47,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:19:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:19:47,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-24 20:19:47,909 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,SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2025-04-24 20:19:47,909 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:47,909 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:47,909 INFO L139 ounterexampleChecker]: Examining path program with hash 1789121896, occurence #1 [2025-04-24 20:19:47,909 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:19:47,909 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:47,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash -536933145, now seen corresponding path program 4 times [2025-04-24 20:19:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:47,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125490236] [2025-04-24 20:19:47,910 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:19:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:47,918 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-24 20:19:47,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-24 20:19:47,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:19:47,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:48,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:48,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125490236] [2025-04-24 20:19:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125490236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:48,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217978845] [2025-04-24 20:19:48,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:19:48,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:48,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:48,150 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 20:19:48,152 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 20:19:48,194 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-24 20:19:48,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-24 20:19:48,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:19:48,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:48,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-24 20:19:48,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:48,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:19:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:48,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217978845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:19:48,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:19:48,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2025-04-24 20:19:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346511116] [2025-04-24 20:19:48,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:19:48,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-24 20:19:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:48,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-24 20:19:48,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2025-04-24 20:19:48,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:48,502 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:48,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:19:48,502 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:49,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:49,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:49,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:49,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:49,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-24 20:19:49,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:19:49,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:19:49,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:49,175 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 20:19:49,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:49,370 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 20:19:49,370 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:19:49,371 INFO L139 ounterexampleChecker]: Examining path program with hash 1789121896, occurence #2 [2025-04-24 20:19:49,371 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:19:49,371 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-24 20:19:49,371 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:49,371 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-24 20:19:49,371 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:49,371 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-24 20:19:49,371 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:49,371 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-24 20:19:49,371 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:19:49,371 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 67 [2025-04-24 20:19:49,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash -503278352, now seen corresponding path program 1 times [2025-04-24 20:19:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-24 20:19:49,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675600676] [2025-04-24 20:19:49,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:49,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-24 20:19:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-24 20:19:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:49,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 1 proven. 133 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:49,883 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-24 20:19:49,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675600676] [2025-04-24 20:19:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675600676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:49,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1537146310] [2025-04-24 20:19:49,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:19:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:49,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-24 20:19:49,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-24 20:19:49,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:19:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:49,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-24 20:19:49,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 1 proven. 133 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1537146310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:50,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 20:19:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2025-04-24 20:19:50,518 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-24 20:19:50,518 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 71 [2025-04-24 20:19:50,518 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:19:50,518 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 73 [2025-04-24 20:19:50,518 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 20:19:50,518 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:19:50,518 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:19:50,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:19:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash -297513213, now seen corresponding path program 5 times [2025-04-24 20:19:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:19:50,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477830690] [2025-04-24 20:19:50,518 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 20:19:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:19:50,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 8 equivalence classes. [2025-04-24 20:19:50,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 75 of 75 statements. [2025-04-24 20:19:50,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-24 20:19:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-04-24 20:19:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:19:50,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477830690] [2025-04-24 20:19:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477830690] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:19:50,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704648787] [2025-04-24 20:19:50,733 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 20:19:50,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:19:50,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:19:50,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:19:50,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 20:19:50,786 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 8 equivalence classes. [2025-04-24 20:19:50,877 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 75 of 75 statements. [2025-04-24 20:19:50,877 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-24 20:19:50,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:19:50,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-24 20:19:50,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:19:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 1 proven. 133 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:51,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:19:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 1 proven. 133 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-24 20:19:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704648787] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:19:51,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:19:51,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19, 19] total 39 [2025-04-24 20:19:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616914484] [2025-04-24 20:19:51,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:19:51,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-24 20:19:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:19:51,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-24 20:19:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2025-04-24 20:19:51,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:19:51,526 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:19:51,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 39 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-24 20:19:51,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:20:21,405 WARN L286 SmtUtils]: Spent 28.94s on a formula simplification. DAG size of input: 65 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:20:24,499 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 20:20:47,464 WARN L286 SmtUtils]: Spent 22.74s on a formula simplification. DAG size of input: 57 DAG size of output: 50 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:21:13,315 WARN L286 SmtUtils]: Spent 20.32s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:21:31,211 WARN L286 SmtUtils]: Spent 12.69s on a formula simplification. DAG size of input: 41 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:21:47,485 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 33 DAG size of output: 26 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 20:22:05,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-24 20:22:05,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-24 20:22:05,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-24 20:22:05,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-24 20:22:05,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-24 20:22:05,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-24 20:22:05,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-24 20:22:05,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2025-04-24 20:22:05,545 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2025-04-24 20:22:05,548 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 20:22:05,548 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 20:22:05,558 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 20:22:05,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 08:22:05 BasicIcfg [2025-04-24 20:22:05,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 20:22:05,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 20:22:05,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 20:22:05,559 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 20:22:05,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:19:36" (3/4) ... [2025-04-24 20:22:05,561 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-24 20:22:05,564 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-04-24 20:22:05,564 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-04-24 20:22:05,564 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-04-24 20:22:05,570 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 87 nodes and edges [2025-04-24 20:22:05,571 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-04-24 20:22:05,571 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-24 20:22:05,571 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-24 20:22:05,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 20:22:05,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 20:22:05,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 20:22:05,633 INFO L158 Benchmark]: Toolchain (without parser) took 149532.21ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.5MB in the beginning and 225.6MB in the end (delta: -103.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-04-24 20:22:05,633 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:22:05,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.71ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 107.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 20:22:05,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:22:05,635 INFO L158 Benchmark]: Boogie Preprocessor took 23.56ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 104.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:22:05,635 INFO L158 Benchmark]: RCFGBuilder took 462.58ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 63.7MB in the end (delta: 40.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-24 20:22:05,635 INFO L158 Benchmark]: TraceAbstraction took 148667.78ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 63.3MB in the beginning and 231.9MB in the end (delta: -168.6MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. [2025-04-24 20:22:05,635 INFO L158 Benchmark]: Witness Printer took 73.15ms. Allocated memory is still 293.6MB. Free memory was 231.9MB in the beginning and 225.6MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:22:05,638 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.71ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 107.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.56ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 104.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 462.58ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 63.7MB in the end (delta: 40.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 148667.78ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 63.3MB in the beginning and 231.9MB in the end (delta: -168.6MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. * Witness Printer took 73.15ms. Allocated memory is still 293.6MB. Free memory was 231.9MB in the beginning and 225.6MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 53294, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 4909, dependent conditional: 4899, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48432, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 47, dependent conditional: 37, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48432, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 47, dependent conditional: 37, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49072, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 687, dependent conditional: 677, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49072, independent: 48385, independent conditional: 371, independent unconditional: 48014, dependent: 687, dependent conditional: 45, dependent unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49072, independent: 48385, independent conditional: 371, independent unconditional: 48014, dependent: 687, dependent conditional: 45, dependent unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 614, independent: 599, independent conditional: 10, independent unconditional: 589, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 614, independent: 586, independent conditional: 0, independent unconditional: 586, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 545, independent: 215, independent conditional: 148, independent unconditional: 66, dependent: 331, dependent conditional: 69, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 4, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 49072, independent: 47786, independent conditional: 361, independent unconditional: 47425, dependent: 672, dependent conditional: 40, dependent unconditional: 632, unknown: 614, unknown conditional: 15, unknown unconditional: 599] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 603, Positive conditional cache size: 14, Positive unconditional cache size: 589, Negative cache size: 15, Negative conditional cache size: 5, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47988, Maximal queried relation: 3, Independence queries for same thread: 4862, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 261, Number of trivial persistent sets: 223, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 668, independent: 658, independent conditional: 0, independent unconditional: 658, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 53294, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 4909, dependent conditional: 4899, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48432, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 47, dependent conditional: 37, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48432, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 47, dependent conditional: 37, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49072, independent: 48385, independent conditional: 47727, independent unconditional: 658, dependent: 687, dependent conditional: 677, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49072, independent: 48385, independent conditional: 371, independent unconditional: 48014, dependent: 687, dependent conditional: 45, dependent unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49072, independent: 48385, independent conditional: 371, independent unconditional: 48014, dependent: 687, dependent conditional: 45, dependent unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 614, independent: 599, independent conditional: 10, independent unconditional: 589, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 614, independent: 586, independent conditional: 0, independent unconditional: 586, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 545, independent: 215, independent conditional: 148, independent unconditional: 66, dependent: 331, dependent conditional: 69, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 4, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 49072, independent: 47786, independent conditional: 361, independent unconditional: 47425, dependent: 672, dependent conditional: 40, dependent unconditional: 632, unknown: 614, unknown conditional: 15, unknown unconditional: 599] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 603, Positive conditional cache size: 14, Positive unconditional cache size: 589, Negative cache size: 15, Negative conditional cache size: 5, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47988, Maximal queried relation: 3, Independence queries for same thread: 4862 - PositiveResult [Line: 110]: 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 7 procedures, 54 locations, 58 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 148.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 137.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 179, 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.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 11593 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 20 InterpolantComputations, 3 PerfectInterpolantSequences, 351/816 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]: 1631, ConditionCalculationTime [ms]: 98, ConditionCalculations: 8, QuantifiedConditions: 0, TraceChecks: 4, UnknownTraceChecks: 0, UnsatisfiedConditions: 1, ImperfectProofs: 2 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-24 20:22:05,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE