./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-100.i --full-output --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1f73d82f Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1f73d82-m [2024-11-21 16:51:24,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 16:51:24,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-21 16:51:24,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 16:51:24,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 16:51:24,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 16:51:24,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 16:51:24,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 16:51:24,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 16:51:24,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 16:51:24,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 16:51:24,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 16:51:24,147 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 16:51:24,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 16:51:24,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 16:51:24,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 16:51:24,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 16:51:24,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 16:51:24,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 16:51:24,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 16:51:24,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 16:51:24,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 16:51:24,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 16:51:24,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 16:51:24,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 16:51:24,150 INFO L153 SettingsManager]: * Commutativity condition synthesis=SUFFICIENT [2024-11-21 16:51:24,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 16:51:24,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 16:51:24,151 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 16:51:24,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 16:51:24,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 16:51:24,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 16:51:24,151 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 16:51:24,151 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 16:51:24,151 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-jdk21/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 -> 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-21 16:51:24,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 16:51:24,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 16:51:24,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 16:51:24,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 16:51:24,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 16:51:24,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-theta/unwind2-100.i [2024-11-21 16:51:25,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/cdeed8fe6/dc95e15bce51443aa66e6aa91c55ba5e/FLAGa62e4562c [2024-11-21 16:51:25,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 16:51:25,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i [2024-11-21 16:51:25,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/cdeed8fe6/dc95e15bce51443aa66e6aa91c55ba5e/FLAGa62e4562c [2024-11-21 16:51:26,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/cdeed8fe6/dc95e15bce51443aa66e6aa91c55ba5e [2024-11-21 16:51:26,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 16:51:26,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 16:51:26,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 16:51:26,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 16:51:26,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 16:51:26,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5d643a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26, skipping insertion in model container [2024-11-21 16:51:26,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 16:51:26,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i[33026,33039] [2024-11-21 16:51:26,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 16:51:26,345 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 16:51:26,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i[33026,33039] [2024-11-21 16:51:26,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 16:51:26,401 INFO L204 MainTranslator]: Completed translation [2024-11-21 16:51:26,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26 WrapperNode [2024-11-21 16:51:26,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 16:51:26,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 16:51:26,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 16:51:26,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 16:51:26,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,426 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2024-11-21 16:51:26,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 16:51:26,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 16:51:26,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 16:51:26,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 16:51:26,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 16:51:26,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 16:51:26,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 16:51:26,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 16:51:26,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (1/1) ... [2024-11-21 16:51:26,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 16:51:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:26,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 16:51:26,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 16:51:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 16:51:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-21 16:51:26,490 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-21 16:51:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-21 16:51:26,490 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-21 16:51:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 16:51:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 16:51:26,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 16:51:26,491 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 16:51:26,596 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 16:51:26,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 16:51:26,713 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 16:51:26,713 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 16:51:26,804 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 16:51:26,804 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 16:51:26,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:26 BoogieIcfgContainer [2024-11-21 16:51:26,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 16:51:26,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 16:51:26,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 16:51:26,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 16:51:26,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:51:26" (1/3) ... [2024-11-21 16:51:26,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dff1e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:51:26, skipping insertion in model container [2024-11-21 16:51:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:26" (2/3) ... [2024-11-21 16:51:26,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dff1e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:51:26, skipping insertion in model container [2024-11-21 16:51:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:26" (3/3) ... [2024-11-21 16:51:26,814 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2024-11-21 16:51:26,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 16:51:26,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-21 16:51:26,825 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 16:51:26,852 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 16:51:26,888 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 16:51:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 16:51:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:26,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 16:51:26,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 16:51:26,950 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 16:51:26,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2024-11-21 16:51:26,965 INFO L333 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;@18403f8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 16:51:26,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 16:51:27,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:27,086 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:27,086 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #1 [2024-11-21 16:51:27,087 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 16:51:27,087 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:27,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1021452415, now seen corresponding path program 1 times [2024-11-21 16:51:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533990489] [2024-11-21 16:51:27,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533990489] [2024-11-21 16:51:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533990489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 16:51:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 16:51:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 16:51:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821645088] [2024-11-21 16:51:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 16:51:27,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 16:51:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:27,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 16:51:27,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 16:51:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:27,387 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 16:51:27,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 16:51:27,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:27,475 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:27,475 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #2 [2024-11-21 16:51:27,475 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:27,475 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:27,485 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:27,485 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:27,485 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:27,485 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:27,485 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1930463403, now seen corresponding path program 1 times [2024-11-21 16:51:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64452347] [2024-11-21 16:51:27,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64452347] [2024-11-21 16:51:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64452347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043547062] [2024-11-21 16:51:27,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:27,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:27,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:27,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 16:51:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:27,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 16:51:27,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:27,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043547062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:27,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-21 16:51:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279459336] [2024-11-21 16:51:27,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:27,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 16:51:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:27,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 16:51:27,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-21 16:51:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:27,822 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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) [2024-11-21 16:51:27,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:27,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:27,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-21 16:51:28,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:28,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:28,180 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:28,180 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #3 [2024-11-21 16:51:28,180 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:28,180 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:28,180 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:28,181 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:28,181 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:28,181 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:28,181 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash -988203735, now seen corresponding path program 2 times [2024-11-21 16:51:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:28,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049667621] [2024-11-21 16:51:28,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:28,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049667621] [2024-11-21 16:51:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049667621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138665533] [2024-11-21 16:51:28,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 16:51:28,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:28,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:28,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 16:51:28,413 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 16:51:28,414 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:28,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 16:51:28,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:28,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138665533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:28,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-21 16:51:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861082060] [2024-11-21 16:51:28,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:28,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-21 16:51:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:28,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-21 16:51:28,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-11-21 16:51:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:28,663 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:28,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 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) [2024-11-21 16:51:28,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:28,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:28,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:28,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 16:51:29,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:29,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:29,123 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:29,123 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #4 [2024-11-21 16:51:29,123 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:29,123 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:29,124 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:29,124 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:29,125 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:29,125 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:29,125 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 489024165, now seen corresponding path program 3 times [2024-11-21 16:51:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436772291] [2024-11-21 16:51:29,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:29,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436772291] [2024-11-21 16:51:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436772291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491503497] [2024-11-21 16:51:29,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 16:51:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:29,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:29,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 16:51:29,454 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-21 16:51:29,454 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:29,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 16:51:29,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-21 16:51:29,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 16:51:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491503497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 16:51:29,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 16:51:29,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2024-11-21 16:51:29,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741254748] [2024-11-21 16:51:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 16:51:29,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 16:51:29,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:29,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 16:51:29,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-21 16:51:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:29,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:29,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 16:51:29,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:29,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:29,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:29,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:29,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-21 16:51:30,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:30,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:30,061 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:30,062 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #1 [2024-11-21 16:51:30,062 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 16:51:30,062 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:30,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash -231950783, now seen corresponding path program 2 times [2024-11-21 16:51:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314117777] [2024-11-21 16:51:30,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:30,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314117777] [2024-11-21 16:51:30,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314117777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 16:51:30,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 16:51:30,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 16:51:30,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256081524] [2024-11-21 16:51:30,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 16:51:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 16:51:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:30,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 16:51:30,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 16:51:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:30,119 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:30,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 16:51:30,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:30,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:30,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:30,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:30,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:30,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 16:51:30,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:30,223 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:30,223 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #2 [2024-11-21 16:51:30,223 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:30,223 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:30,223 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:30,223 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:51:30,223 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:30,223 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:30,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash 59368488, now seen corresponding path program 1 times [2024-11-21 16:51:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:51:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150575037] [2024-11-21 16:51:30,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:51:30,236 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:51:30,237 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:51:30,237 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:30,237 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:30,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash 432320363, now seen corresponding path program 4 times [2024-11-21 16:51:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:30,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735914394] [2024-11-21 16:51:30,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:30,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735914394] [2024-11-21 16:51:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735914394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643245465] [2024-11-21 16:51:30,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 16:51:30,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:30,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:30,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:30,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 16:51:30,348 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 16:51:30,349 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:30,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 16:51:30,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:30,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643245465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:30,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:30,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2024-11-21 16:51:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056001883] [2024-11-21 16:51:30,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:30,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-21 16:51:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:30,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-21 16:51:30,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-21 16:51:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:30,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:30,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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) [2024-11-21 16:51:30,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:30,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:30,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:30,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:30,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:30,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:31,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-21 16:51:31,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:31,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:31,356 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:31,357 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #3 [2024-11-21 16:51:31,357 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:31,357 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:31,357 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:31,357 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:51:31,357 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:31,357 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:31,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash 59368497, now seen corresponding path program 1 times [2024-11-21 16:51:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:51:31,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687788776] [2024-11-21 16:51:31,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:51:31,366 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:51:31,366 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:51:31,366 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:31,366 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1850035177, now seen corresponding path program 5 times [2024-11-21 16:51:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559600353] [2024-11-21 16:51:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559600353] [2024-11-21 16:51:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559600353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540757442] [2024-11-21 16:51:31,470 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 16:51:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:31,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:31,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 16:51:31,518 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-21 16:51:31,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:31,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 16:51:31,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:31,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540757442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:31,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:31,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-21 16:51:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821434576] [2024-11-21 16:51:31,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:31,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-21 16:51:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:31,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-21 16:51:31,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-11-21 16:51:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:31,691 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:31,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 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) [2024-11-21 16:51:31,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:31,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:31,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:31,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:31,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:31,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:31,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:32,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 16:51:32,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:32,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:32,197 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:32,197 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #4 [2024-11-21 16:51:32,197 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:32,197 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:32,197 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:32,197 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:51:32,197 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:32,197 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash 59368506, now seen corresponding path program 1 times [2024-11-21 16:51:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:51:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245998976] [2024-11-21 16:51:32,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:51:32,209 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:51:32,209 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:51:32,209 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:32,209 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:32,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1994006171, now seen corresponding path program 6 times [2024-11-21 16:51:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145855131] [2024-11-21 16:51:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:32,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145855131] [2024-11-21 16:51:32,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145855131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311218898] [2024-11-21 16:51:32,447 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 16:51:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:32,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:32,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 16:51:32,509 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-21 16:51:32,510 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:32,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-21 16:51:32,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:32,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311218898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:32,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-11-21 16:51:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713410930] [2024-11-21 16:51:32,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-21 16:51:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:32,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-21 16:51:32,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2024-11-21 16:51:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:32,989 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:32,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 40 states have internal predecessors, (92), 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) [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:32,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:51:33,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-21 16:51:33,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:33,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:33,729 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:33,729 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #5 [2024-11-21 16:51:33,729 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:33,729 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:33,729 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:33,729 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:51:33,729 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:33,729 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:33,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash 59368515, now seen corresponding path program 1 times [2024-11-21 16:51:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:51:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935710991] [2024-11-21 16:51:33,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:51:33,737 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:51:33,737 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:51:33,737 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:33,737 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1117979043, now seen corresponding path program 7 times [2024-11-21 16:51:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753227217] [2024-11-21 16:51:33,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753227217] [2024-11-21 16:51:34,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753227217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903298055] [2024-11-21 16:51:34,211 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-21 16:51:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:34,213 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:34,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 16:51:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:34,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-21 16:51:34,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:34,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903298055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:35,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2024-11-21 16:51:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098454000] [2024-11-21 16:51:35,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-11-21 16:51:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:35,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-11-21 16:51:35,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2269, Invalid=3583, Unknown=0, NotChecked=0, Total=5852 [2024-11-21 16:51:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:35,492 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:35,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 76 states have internal predecessors, (164), 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) [2024-11-21 16:51:35,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:35,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:35,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:35,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:35,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:35,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:51:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 16:51:36,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-21 16:51:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:37,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:37,155 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:37,155 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #6 [2024-11-21 16:51:37,155 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:37,155 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:37,155 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:37,155 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:51:37,155 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:37,155 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 59368524, now seen corresponding path program 1 times [2024-11-21 16:51:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:51:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927942518] [2024-11-21 16:51:37,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:51:37,162 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:51:37,162 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:51:37,162 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:37,163 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:37,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1205403571, now seen corresponding path program 8 times [2024-11-21 16:51:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:37,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291400287] [2024-11-21 16:51:37,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:37,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291400287] [2024-11-21 16:51:38,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291400287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478505216] [2024-11-21 16:51:38,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 16:51:38,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:38,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:38,620 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:38,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 16:51:38,699 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 16:51:38,699 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:38,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-21 16:51:38,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:39,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:42,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478505216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:42,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:42,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 148 [2024-11-21 16:51:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760311920] [2024-11-21 16:51:42,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:42,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2024-11-21 16:51:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2024-11-21 16:51:42,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9133, Invalid=12919, Unknown=0, NotChecked=0, Total=22052 [2024-11-21 16:51:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:42,387 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:42,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 2.0671140939597317) internal successors, (308), 148 states have internal predecessors, (308), 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) [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-11-21 16:51:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 16:51:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-21 16:51:46,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-21 16:51:46,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:46,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:51:46,808 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:51:46,808 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #7 [2024-11-21 16:51:46,808 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:51:46,808 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:51:46,808 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:46,808 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:51:46,808 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:51:46,808 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:51:46,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 59368533, now seen corresponding path program 1 times [2024-11-21 16:51:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:51:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621152071] [2024-11-21 16:51:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:51:46,816 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:51:46,816 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:51:46,816 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:51:46,817 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:51:46,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:51:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -951442387, now seen corresponding path program 9 times [2024-11-21 16:51:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:51:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16406588] [2024-11-21 16:51:46,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:51:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:51:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:51:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:51,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:51:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16406588] [2024-11-21 16:51:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16406588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:51:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376305128] [2024-11-21 16:51:51,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 16:51:51,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:51:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:51:51,186 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:51:51,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 16:51:51,382 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2024-11-21 16:51:51,382 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:51:51,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-21 16:51:51,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:51:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:55,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:51:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:51:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376305128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:51:59,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:51:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 202 [2024-11-21 16:51:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424698751] [2024-11-21 16:51:59,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:51:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2024-11-21 16:51:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:51:59,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2024-11-21 16:51:59,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2024-11-21 16:51:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:51:59,114 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:51:59,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 2.0541871921182264) internal successors, (417), 202 states have internal predecessors, (417), 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) [2024-11-21 16:51:59,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:59,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2024-11-21 16:51:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:52:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:52:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:52:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:52:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:52:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:52:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:52:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:52:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:52:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 16:52:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-21 16:52:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-21 16:52:04,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-21 16:52:04,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-11-21 16:52:04,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 16:52:04,654 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 16:52:04,654 INFO L139 ounterexampleChecker]: Examining path program with hash -1143144318, occurence #8 [2024-11-21 16:52:04,654 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 16:52:04,654 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 16:52:04,654 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:52:04,654 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 16:52:04,654 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 16:52:04,654 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 16:52:04,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:52:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash 59368542, now seen corresponding path program 1 times [2024-11-21 16:52:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 16:52:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624952203] [2024-11-21 16:52:04,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:52:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:52:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 16:52:04,661 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 16:52:04,661 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 16:52:04,661 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 16:52:04,661 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 16:52:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 16:52:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1685353385, now seen corresponding path program 10 times [2024-11-21 16:52:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 16:52:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741264745] [2024-11-21 16:52:04,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 16:52:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 16:52:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 16:52:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 10000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:52:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 16:52:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741264745] [2024-11-21 16:52:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741264745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 16:52:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95644257] [2024-11-21 16:52:09,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 16:52:09,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 16:52:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 16:52:09,052 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 16:52:09,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-21 16:52:09,166 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 16:52:09,166 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 16:52:09,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 206 conjuncts are in the unsatisfiable core [2024-11-21 16:52:09,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 16:52:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:52:23,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 16:52:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 16:52:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95644257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 16:52:54,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 16:52:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 205, 205] total 512 [2024-11-21 16:52:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864721660] [2024-11-21 16:52:54,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 16:52:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 512 states [2024-11-21 16:52:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 16:52:54,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 512 interpolants. [2024-11-21 16:52:54,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46978, Invalid=214654, Unknown=0, NotChecked=0, Total=261632 [2024-11-21 16:52:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 16:52:54,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 16:52:54,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 512 states, 512 states have (on average 1.236328125) internal successors, (633), 512 states have internal predecessors, (633), 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) [2024-11-21 16:52:54,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:52:54,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 16:52:54,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:52:54,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-11-21 16:52:54,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-21 17:01:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-21 17:01:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1415 states. [2024-11-21 17:01:21,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-21 17:01:21,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-21 17:01:21,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 17:01:21,351 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 17:01:21,352 INFO L139 ounterexampleChecker]: Examining path program with hash 936681279, occurence #1 [2024-11-21 17:01:21,352 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 17:01:21,352 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 17:01:21,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 17:01:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash -425389946, now seen corresponding path program 1 times [2024-11-21 17:01:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 17:01:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286919308] [2024-11-21 17:01:21,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 17:01:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 17:01:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 17:01:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10003 backedges. 9804 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 17:01:26,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 17:01:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286919308] [2024-11-21 17:01:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286919308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 17:01:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8336781] [2024-11-21 17:01:26,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 17:01:26,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 17:01:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 17:01:26,067 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 17:01:26,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-21 17:01:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 17:01:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-21 17:01:26,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 17:01:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10003 backedges. 10002 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 17:01:34,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 17:01:34,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8336781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 17:01:34,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 17:01:34,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [106] total 207 [2024-11-21 17:01:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901488262] [2024-11-21 17:01:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 17:01:34,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-11-21 17:01:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 17:01:34,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-11-21 17:01:34,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15564, Invalid=27492, Unknown=0, NotChecked=0, Total=43056 [2024-11-21 17:01:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 17:01:34,698 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 17:01:34,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 2.0660377358490565) internal successors, (219), 105 states have internal predecessors, (219), 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) [2024-11-21 17:01:34,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:34,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 1415 states. [2024-11-21 17:01:34,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-21 17:01:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1415 states. [2024-11-21 17:01:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-21 17:01:38,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-21 17:01:38,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 17:01:38,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 17:01:38,526 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 17:01:38,527 INFO L139 ounterexampleChecker]: Examining path program with hash 936681279, occurence #2 [2024-11-21 17:01:38,527 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 17:01:38,527 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-21 17:01:38,527 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 17:01:38,527 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 17:01:38,527 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 17:01:38,527 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-11-21 17:01:38,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 17:01:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash 59368557, now seen corresponding path program 1 times [2024-11-21 17:01:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-21 17:01:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703361082] [2024-11-21 17:01:38,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 17:01:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 17:01:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 17:01:38,533 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-11-21 17:01:38,533 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-11-21 17:01:38,533 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 17:01:38,533 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 17:01:38,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 17:01:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 442015974, now seen corresponding path program 2 times [2024-11-21 17:01:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 17:01:38,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455240765] [2024-11-21 17:01:38,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 17:01:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 17:01:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 17:01:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 17:01:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 17:01:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455240765] [2024-11-21 17:01:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455240765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 17:01:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748753217] [2024-11-21 17:01:44,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 17:01:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 17:01:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 17:01:44,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 17:01:44,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-21 17:01:44,119 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 17:01:44,119 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 17:01:44,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 215 conjuncts are in the unsatisfiable core [2024-11-21 17:01:44,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 17:01:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 17:01:50,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 17:01:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 17:01:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748753217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 17:01:59,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 17:01:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 105, 106] total 312 [2024-11-21 17:01:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488799930] [2024-11-21 17:01:59,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 17:01:59,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 313 states [2024-11-21 17:01:59,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 17:01:59,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 313 interpolants. [2024-11-21 17:01:59,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5983, Invalid=91673, Unknown=0, NotChecked=0, Total=97656 [2024-11-21 17:01:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 17:01:59,879 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 17:01:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 313 states, 313 states have (on average 2.0319488817891376) internal successors, (636), 312 states have internal predecessors, (636), 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) [2024-11-21 17:01:59,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:59,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 17:01:59,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 1415 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-11-21 17:01:59,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1415 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-21 17:03:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 410 states. [2024-11-21 17:03:21,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-21 17:03:21,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 17:03:21,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 17:03:21,248 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 17:03:21,248 INFO L139 ounterexampleChecker]: Examining path program with hash -1664967892, occurence #1 [2024-11-21 17:03:21,248 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 17:03:21,248 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 17:03:21,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 17:03:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash 848366617, now seen corresponding path program 1 times [2024-11-21 17:03:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 17:03:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704718979] [2024-11-21 17:03:21,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 17:03:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 17:03:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 17:03:21,441 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 17:03:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 17:03:21,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 17:03:21,563 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 17:03:21,564 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 17:03:21,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 17:03:21,568 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 2, 1] [2024-11-21 17:03:21,570 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/3) [2024-11-21 17:03:21,680 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-21 17:03:21,680 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 17:03:21,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-11-21 17:03:21,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:03:21 BasicIcfg [2024-11-21 17:03:21,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 17:03:21,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 17:03:21,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 17:03:21,698 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 17:03:21,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:26" (3/4) ... [2024-11-21 17:03:21,699 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 17:03:21,785 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 211. [2024-11-21 17:03:21,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-11-21 17:03:21,885 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2024-11-21 17:03:21,885 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 17:03:21,885 INFO L158 Benchmark]: Toolchain (without parser) took 715763.87ms. Allocated memory was 83.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 58.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 984.8MB. Max. memory is 16.1GB. [2024-11-21 17:03:21,886 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 17:03:21,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.58ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 38.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 17:03:21,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.94ms. Allocated memory is still 83.9MB. Free memory was 38.5MB in the beginning and 36.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 17:03:21,887 INFO L158 Benchmark]: Boogie Preprocessor took 12.41ms. Allocated memory is still 83.9MB. Free memory was 36.8MB in the beginning and 35.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 17:03:21,887 INFO L158 Benchmark]: RCFGBuilder took 365.26ms. Allocated memory is still 83.9MB. Free memory was 35.7MB in the beginning and 54.0MB in the end (delta: -18.4MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-21 17:03:21,887 INFO L158 Benchmark]: TraceAbstraction took 714891.27ms. Allocated memory was 83.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 53.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 938.5MB. Max. memory is 16.1GB. [2024-11-21 17:03:21,887 INFO L158 Benchmark]: Witness Printer took 186.97ms. Allocated memory is still 2.9GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-21 17:03:21,890 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.58ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 38.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.94ms. Allocated memory is still 83.9MB. Free memory was 38.5MB in the beginning and 36.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.41ms. Allocated memory is still 83.9MB. Free memory was 36.8MB in the beginning and 35.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.26ms. Allocated memory is still 83.9MB. Free memory was 35.7MB in the beginning and 54.0MB in the end (delta: -18.4MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 714891.27ms. Allocated memory was 83.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 53.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 938.5MB. Max. memory is 16.1GB. * Witness Printer took 186.97ms. Allocated memory is still 2.9GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. 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: 80435, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 15487, dependent conditional: 15479, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64997, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 49, dependent conditional: 41, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64997, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 49, dependent conditional: 41, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65295, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 347, dependent conditional: 339, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65295, independent: 64948, independent conditional: 0, independent unconditional: 64948, dependent: 347, dependent conditional: 298, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65295, independent: 64948, independent conditional: 0, independent unconditional: 64948, dependent: 347, dependent conditional: 298, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 378, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 378, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 47, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 238, dependent conditional: 158, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 8, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 65295, independent: 64615, independent conditional: 0, independent unconditional: 64615, dependent: 302, dependent conditional: 261, dependent unconditional: 41, unknown: 378, unknown conditional: 37, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 341, Positive conditional cache size: 8, Positive unconditional cache size: 333, Negative cache size: 45, Negative conditional cache size: 37, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64657, Maximal queried relation: 13, Independence queries for same thread: 15438, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 55, Number of trivial persistent sets: 39, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 80435, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 15487, dependent conditional: 15479, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64997, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 49, dependent conditional: 41, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64997, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 49, dependent conditional: 41, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65295, independent: 64948, independent conditional: 64616, independent unconditional: 332, dependent: 347, dependent conditional: 339, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65295, independent: 64948, independent conditional: 0, independent unconditional: 64948, dependent: 347, dependent conditional: 298, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65295, independent: 64948, independent conditional: 0, independent unconditional: 64948, dependent: 347, dependent conditional: 298, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 378, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 378, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 47, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 238, dependent conditional: 158, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 8, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 65295, independent: 64615, independent conditional: 0, independent unconditional: 64615, dependent: 302, dependent conditional: 261, dependent unconditional: 41, unknown: 378, unknown conditional: 37, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 341, Positive conditional cache size: 8, Positive unconditional cache size: 333, Negative cache size: 45, Negative conditional cache size: 37, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64657, Maximal queried relation: 13, Independence queries for same thread: 15438 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L760] 1 bound = limit [L761] 1 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L761] COND FALSE 1 !(i < bound) [L762] CALL 1 __VERIFIER_assert(i == lim) [L753] COND FALSE 1 !(!expression) VAL [\old(expression)=1, _N=100, expression=1, limit=100] [L762] RET 1 __VERIFIER_assert(i == lim) [L763] 1 return 0; [L780] FCALL, JOIN 1 pthread_join(t1, 0) VAL [_N=100, limit=100, t1=0, t2=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=100, expression=0, limit=100] [L753] 2 reach_error() VAL [\old(expression)=0, _N=100, expression=0, limit=100] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 714.6s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 604.7s, 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: 2299, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 105.3s InterpolantComputationTime, 2588 NumberOfCodeBlocks, 2568 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 3250 ConstructedInterpolants, 0 QuantifiedInterpolants, 19883 SizeOfPredicates, 57 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 768 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 29917/115782 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 81, ConditionCalculationTime [ms]: 26, ConditionCalculations: 8, QuantifiedConditions: 0, TraceChecks: 8, UnknownTraceChecks: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-21 17:03:21,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE