./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 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 ../../../trunk/examples/svcomp/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.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 05:03:07,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 05:03:07,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 05:03:07,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 05:03:07,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 05:03:07,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 05:03:07,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 05:03:07,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 05:03:07,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 05:03:07,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 05:03:07,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 05:03:07,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 05:03:07,356 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 05:03:07,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 05:03:07,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 05:03:07,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 05:03:07,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 05:03:07,358 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 05:03:07,359 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 05:03:07,359 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: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 05:03:07,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 05:03:07,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 05:03:07,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 05:03:07,666 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 05:03:07,668 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 05:03:07,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-01-24 05:03:08,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/13c26769c/d298d3abc59140df844fdb622640bf41/FLAG303538ed3 [2025-01-24 05:03:09,197 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 05:03:09,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-01-24 05:03:09,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/13c26769c/d298d3abc59140df844fdb622640bf41/FLAG303538ed3 [2025-01-24 05:03:09,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/13c26769c/d298d3abc59140df844fdb622640bf41 [2025-01-24 05:03:09,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 05:03:09,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 05:03:09,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 05:03:09,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 05:03:09,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 05:03:09,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cec2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09, skipping insertion in model container [2025-01-24 05:03:09,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 05:03:09,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-01-24 05:03:09,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 05:03:09,627 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 05:03:09,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-01-24 05:03:09,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 05:03:09,789 INFO L204 MainTranslator]: Completed translation [2025-01-24 05:03:09,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09 WrapperNode [2025-01-24 05:03:09,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 05:03:09,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 05:03:09,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 05:03:09,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 05:03:09,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,825 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-01-24 05:03:09,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 05:03:09,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 05:03:09,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 05:03:09,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 05:03:09,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 05:03:09,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 05:03:09,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 05:03:09,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 05:03:09,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (1/1) ... [2025-01-24 05:03:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 05:03:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:09,884 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) [2025-01-24 05:03:09,887 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 [2025-01-24 05:03:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 05:03:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-24 05:03:09,908 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-24 05:03:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-24 05:03:09,909 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-24 05:03:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 05:03:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 05:03:09,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 05:03:09,910 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 05:03:10,022 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 05:03:10,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 05:03:10,138 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 05:03:10,138 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 05:03:10,238 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 05:03:10,239 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-24 05:03:10,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:10 BoogieIcfgContainer [2025-01-24 05:03:10,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 05:03:10,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 05:03:10,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 05:03:10,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 05:03:10,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:03:09" (1/3) ... [2025-01-24 05:03:10,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4ae644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:03:10, skipping insertion in model container [2025-01-24 05:03:10,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:09" (2/3) ... [2025-01-24 05:03:10,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4ae644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:03:10, skipping insertion in model container [2025-01-24 05:03:10,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:10" (3/3) ... [2025-01-24 05:03:10,249 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-01-24 05:03:10,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 05:03:10,260 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. [2025-01-24 05:03:10,261 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 05:03:10,293 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-24 05:03:10,333 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 05:03:10,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 05:03:10,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:10,337 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) [2025-01-24 05:03:10,338 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 [2025-01-24 05:03:10,426 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 05:03:10,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2025-01-24 05:03:10,450 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;@8dafcda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 05:03:10,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 05:03:10,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:10,635 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:10,635 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #1 [2025-01-24 05:03:10,635 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 05:03:10,635 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 210329393, now seen corresponding path program 1 times [2025-01-24 05:03:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250853337] [2025-01-24 05:03:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-24 05:03:10,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-24 05:03:10,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:10,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:10,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250853337] [2025-01-24 05:03:10,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250853337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 05:03:10,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 05:03:10,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 05:03:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030183348] [2025-01-24 05:03:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 05:03:10,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-24 05:03:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:10,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-24 05:03:10,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-24 05:03:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:10,971 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:10,973 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) [2025-01-24 05:03:10,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 05:03:11,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:11,098 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:11,099 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #2 [2025-01-24 05:03:11,099 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:11,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:11,116 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:11,116 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:11,116 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:11,116 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:11,116 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 261806747, now seen corresponding path program 1 times [2025-01-24 05:03:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:11,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138140461] [2025-01-24 05:03:11,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:11,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-24 05:03:11,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-24 05:03:11,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:11,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:11,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138140461] [2025-01-24 05:03:11,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138140461] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:11,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016622699] [2025-01-24 05:03:11,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:11,324 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) [2025-01-24 05:03:11,326 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 [2025-01-24 05:03:11,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-24 05:03:11,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-24 05:03:11,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:11,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:11,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-24 05:03:11,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:11,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016622699] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:11,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-24 05:03:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327389739] [2025-01-24 05:03:11,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-24 05:03:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:11,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-24 05:03:11,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-24 05:03:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:11,584 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:11,584 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) [2025-01-24 05:03:11,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:11,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:11,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-24 05:03:11,998 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 [2025-01-24 05:03:11,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:11,999 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:11,999 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #3 [2025-01-24 05:03:11,999 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:11,999 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:11,999 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:11,999 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:11,999 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:11,999 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:11,999 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:12,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1442144807, now seen corresponding path program 2 times [2025-01-24 05:03:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601470119] [2025-01-24 05:03:12,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:12,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-24 05:03:12,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-24 05:03:12,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 05:03:12,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601470119] [2025-01-24 05:03:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601470119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97109996] [2025-01-24 05:03:12,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:12,238 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) [2025-01-24 05:03:12,239 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 [2025-01-24 05:03:12,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-24 05:03:12,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-24 05:03:12,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 05:03:12,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:12,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-24 05:03:12,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:12,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97109996] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:12,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:12,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-24 05:03:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058742505] [2025-01-24 05:03:12,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-24 05:03:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:12,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-24 05:03:12,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-01-24 05:03:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:12,550 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:12,550 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) [2025-01-24 05:03:12,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:12,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:12,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:12,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-24 05:03:13,072 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 [2025-01-24 05:03:13,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:13,073 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:13,073 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #4 [2025-01-24 05:03:13,074 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:13,074 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:13,075 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:13,075 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:13,075 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:13,075 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:13,075 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1581428523, now seen corresponding path program 3 times [2025-01-24 05:03:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283216175] [2025-01-24 05:03:13,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 05:03:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:13,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-01-24 05:03:13,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 35 statements. [2025-01-24 05:03:13,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-24 05:03:13,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-24 05:03:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:13,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283216175] [2025-01-24 05:03:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283216175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:13,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130201556] [2025-01-24 05:03:13,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 05:03:13,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:13,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:13,213 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) [2025-01-24 05:03:13,216 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 [2025-01-24 05:03:13,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-01-24 05:03:13,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 35 statements. [2025-01-24 05:03:13,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-24 05:03:13,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:13,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-24 05:03:13,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-24 05:03:13,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 05:03:13,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130201556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 05:03:13,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-24 05:03:13,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-24 05:03:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605897268] [2025-01-24 05:03:13,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 05:03:13,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-24 05:03:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:13,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-24 05:03:13,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-24 05:03:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:13,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:13,357 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) [2025-01-24 05:03:13,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:13,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:13,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:13,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:13,756 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 [2025-01-24 05:03:13,953 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 [2025-01-24 05:03:13,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:13,953 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:13,953 INFO L139 ounterexampleChecker]: Examining path program with hash 1535588422, occurence #1 [2025-01-24 05:03:13,953 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 05:03:13,953 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:13,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 999831025, now seen corresponding path program 2 times [2025-01-24 05:03:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:13,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840114932] [2025-01-24 05:03:13,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:13,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:13,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-24 05:03:13,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-24 05:03:13,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 05:03:13,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:14,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840114932] [2025-01-24 05:03:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840114932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 05:03:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 05:03:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 05:03:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926549207] [2025-01-24 05:03:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 05:03:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 05:03:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:14,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 05:03:14,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-24 05:03:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:14,019 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:14,019 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) [2025-01-24 05:03:14,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:14,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:14,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:14,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-24 05:03:14,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:14,140 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:14,140 INFO L139 ounterexampleChecker]: Examining path program with hash 1535588422, occurence #2 [2025-01-24 05:03:14,140 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:14,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:14,140 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:14,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:14,140 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:14,141 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:14,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956904, now seen corresponding path program 1 times [2025-01-24 05:03:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914674588] [2025-01-24 05:03:14,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:14,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:14,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:14,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:14,159 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:14,160 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:14,160 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:14,160 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1236336293, now seen corresponding path program 4 times [2025-01-24 05:03:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824224208] [2025-01-24 05:03:14,161 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 05:03:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:14,166 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-01-24 05:03:14,169 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 17 statements. [2025-01-24 05:03:14,169 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-24 05:03:14,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-24 05:03:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824224208] [2025-01-24 05:03:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824224208] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943370541] [2025-01-24 05:03:14,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 05:03:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:14,268 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) [2025-01-24 05:03:14,270 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 [2025-01-24 05:03:14,308 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-01-24 05:03:14,317 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 17 statements. [2025-01-24 05:03:14,317 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-24 05:03:14,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:14,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-24 05:03:14,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:14,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943370541] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:14,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-24 05:03:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330854299] [2025-01-24 05:03:14,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-24 05:03:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:14,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-24 05:03:14,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-24 05:03:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:14,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:14,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:14,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:14,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:14,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:14,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:14,988 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 [2025-01-24 05:03:15,180 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 [2025-01-24 05:03:15,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:15,181 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:15,181 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #1 [2025-01-24 05:03:15,181 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 05:03:15,181 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 448656802, now seen corresponding path program 1 times [2025-01-24 05:03:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039665506] [2025-01-24 05:03:15,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:15,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-24 05:03:15,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-24 05:03:15,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:15,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039665506] [2025-01-24 05:03:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039665506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812532707] [2025-01-24 05:03:15,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:15,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:15,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:15,299 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) [2025-01-24 05:03:15,303 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 [2025-01-24 05:03:15,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-24 05:03:15,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-24 05:03:15,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:15,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:15,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-24 05:03:15,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:15,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812532707] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:15,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-24 05:03:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570372615] [2025-01-24 05:03:15,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:15,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-24 05:03:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:15,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-24 05:03:15,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-01-24 05:03:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:15,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:15,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:15,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-24 05:03:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:16,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:16,072 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:16,072 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #2 [2025-01-24 05:03:16,072 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:16,072 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:16,072 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:16,072 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:16,072 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:16,072 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956891, now seen corresponding path program 1 times [2025-01-24 05:03:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824483362] [2025-01-24 05:03:16,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:16,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:16,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:16,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:16,084 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:16,084 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:16,084 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:16,084 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1343796150, now seen corresponding path program 2 times [2025-01-24 05:03:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77495008] [2025-01-24 05:03:16,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:16,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-24 05:03:16,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-24 05:03:16,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 05:03:16,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77495008] [2025-01-24 05:03:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77495008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203725356] [2025-01-24 05:03:16,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:16,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:16,274 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) [2025-01-24 05:03:16,276 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 [2025-01-24 05:03:16,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-24 05:03:16,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-24 05:03:16,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 05:03:16,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:16,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-24 05:03:16,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:16,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203725356] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:16,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-01-24 05:03:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109173342] [2025-01-24 05:03:16,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-24 05:03:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-24 05:03:16,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2025-01-24 05:03:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:16,645 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:16,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:16,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:16,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:17,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-24 05:03:17,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:17,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:17,544 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:17,544 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #3 [2025-01-24 05:03:17,544 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:17,544 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:17,545 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:17,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:17,545 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:17,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:17,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956882, now seen corresponding path program 1 times [2025-01-24 05:03:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:17,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107103658] [2025-01-24 05:03:17,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:17,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:17,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:17,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:17,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:17,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:17,556 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:17,556 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:17,556 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:17,556 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:17,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2038071706, now seen corresponding path program 3 times [2025-01-24 05:03:17,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:17,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159905729] [2025-01-24 05:03:17,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 05:03:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:17,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 15 equivalence classes. [2025-01-24 05:03:17,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 47 statements. [2025-01-24 05:03:17,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-24 05:03:17,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-24 05:03:17,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:17,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159905729] [2025-01-24 05:03:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159905729] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:17,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246832454] [2025-01-24 05:03:17,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 05:03:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:17,653 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) [2025-01-24 05:03:17,654 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 [2025-01-24 05:03:17,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 15 equivalence classes. [2025-01-24 05:03:17,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 47 statements. [2025-01-24 05:03:17,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-24 05:03:17,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:17,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-24 05:03:17,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-24 05:03:17,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 05:03:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246832454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 05:03:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-24 05:03:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-24 05:03:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471896352] [2025-01-24 05:03:17,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 05:03:17,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-24 05:03:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:17,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-24 05:03:17,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-24 05:03:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:17,783 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:17,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:17,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:17,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-24 05:03:18,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:18,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:18,169 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:18,169 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #1 [2025-01-24 05:03:18,169 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 05:03:18,169 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1706546089, now seen corresponding path program 1 times [2025-01-24 05:03:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840360085] [2025-01-24 05:03:18,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:18,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-24 05:03:18,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-24 05:03:18,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:18,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840360085] [2025-01-24 05:03:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840360085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191583264] [2025-01-24 05:03:18,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:18,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:18,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:18,533 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) [2025-01-24 05:03:18,535 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 [2025-01-24 05:03:18,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-24 05:03:18,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-24 05:03:18,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:18,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:18,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-24 05:03:18,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:18,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191583264] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:19,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2025-01-24 05:03:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893976190] [2025-01-24 05:03:19,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:19,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-01-24 05:03:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:19,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-01-24 05:03:19,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=1751, Unknown=0, NotChecked=0, Total=2756 [2025-01-24 05:03:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:19,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:19,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:19,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:19,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:21,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-24 05:03:21,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:21,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:21,281 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:21,281 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #2 [2025-01-24 05:03:21,281 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:21,281 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:21,281 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:21,282 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:21,282 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:21,282 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956871, now seen corresponding path program 1 times [2025-01-24 05:03:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200407011] [2025-01-24 05:03:21,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:21,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:21,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:21,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:21,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:21,292 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:21,292 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:21,292 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:21,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:21,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash 215020983, now seen corresponding path program 2 times [2025-01-24 05:03:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105996384] [2025-01-24 05:03:21,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:21,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-24 05:03:21,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-24 05:03:21,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 05:03:21,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105996384] [2025-01-24 05:03:22,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105996384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748417332] [2025-01-24 05:03:22,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 05:03:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:22,336 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) [2025-01-24 05:03:22,338 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 [2025-01-24 05:03:22,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-24 05:03:22,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-24 05:03:22,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 05:03:22,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:22,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-24 05:03:22,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:23,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 05:03:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748417332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:25,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35, 35] total 102 [2025-01-24 05:03:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448097847] [2025-01-24 05:03:25,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-01-24 05:03:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-01-24 05:03:25,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2625, Invalid=7881, Unknown=0, NotChecked=0, Total=10506 [2025-01-24 05:03:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:25,218 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:25,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.145631067961165) internal successors, (221), 102 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:25,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-01-24 05:03:38,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-24 05:03:38,468 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,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2025-01-24 05:03:38,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:38,468 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:38,469 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #3 [2025-01-24 05:03:38,469 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:38,469 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:38,469 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:38,469 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:38,469 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:38,469 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:38,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956862, now seen corresponding path program 1 times [2025-01-24 05:03:38,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:38,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972704617] [2025-01-24 05:03:38,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:38,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:38,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:38,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:38,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:38,479 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:38,479 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:38,479 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:38,479 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1570109321, now seen corresponding path program 3 times [2025-01-24 05:03:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261826569] [2025-01-24 05:03:38,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 05:03:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:38,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 144 statements into 63 equivalence classes. [2025-01-24 05:03:38,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) and asserted 144 of 144 statements. [2025-01-24 05:03:38,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2025-01-24 05:03:38,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261826569] [2025-01-24 05:03:41,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261826569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 05:03:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422305699] [2025-01-24 05:03:41,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 05:03:41,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 05:03:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 05:03:41,395 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) [2025-01-24 05:03:41,396 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 [2025-01-24 05:03:41,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 144 statements into 63 equivalence classes. [2025-01-24 05:03:41,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) and asserted 144 of 144 statements. [2025-01-24 05:03:41,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2025-01-24 05:03:41,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:41,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-24 05:03:41,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 05:03:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:43,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 05:03:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 05:03:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422305699] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 05:03:47,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 05:03:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 172 [2025-01-24 05:03:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640687052] [2025-01-24 05:03:47,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 05:03:47,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 173 states [2025-01-24 05:03:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:47,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2025-01-24 05:03:47,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11860, Invalid=17896, Unknown=0, NotChecked=0, Total=29756 [2025-01-24 05:03:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:47,188 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:47,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 173 states, 173 states have (on average 2.098265895953757) internal successors, (363), 172 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2025-01-24 05:03:47,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-01-24 05:03:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-01-24 05:03:52,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-24 05:03:52,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2025-01-24 05:03:52,859 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:52,859 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:52,860 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #4 [2025-01-24 05:03:52,860 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:52,860 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:52,860 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:52,860 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:52,860 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:52,860 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:52,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956853, now seen corresponding path program 1 times [2025-01-24 05:03:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:52,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327135186] [2025-01-24 05:03:52,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:52,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:52,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:52,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:52,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:52,868 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:52,868 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:52,868 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:52,868 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2118994875, now seen corresponding path program 4 times [2025-01-24 05:03:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124183717] [2025-01-24 05:03:52,869 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 05:03:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:52,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 220 statements into 2 equivalence classes. [2025-01-24 05:03:53,128 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 219 of 220 statements. [2025-01-24 05:03:53,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-24 05:03:53,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 05:03:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10003 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10000 trivial. 0 not checked. [2025-01-24 05:03:57,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 05:03:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124183717] [2025-01-24 05:03:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124183717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 05:03:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 05:03:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-24 05:03:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733412569] [2025-01-24 05:03:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 05:03:57,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-24 05:03:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 05:03:57,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-24 05:03:57,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-24 05:03:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:57,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 05:03:57,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2025-01-24 05:03:57,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-24 05:03:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-01-24 05:03:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-01-24 05:03:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-24 05:03:58,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable17 [2025-01-24 05:03:58,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 05:03:58,079 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 05:03:58,079 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #5 [2025-01-24 05:03:58,079 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 05:03:58,079 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 05:03:58,079 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:58,079 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 05:03:58,079 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 05:03:58,080 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-01-24 05:03:58,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956846, now seen corresponding path program 1 times [2025-01-24 05:03:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 05:03:58,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037138984] [2025-01-24 05:03:58,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 05:03:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:58,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-24 05:03:58,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-24 05:03:58,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:58,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:58,087 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 05:03:58,087 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 05:03:58,087 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 05:03:58,087 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 05:03:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 05:03:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1097176859, now seen corresponding path program 5 times [2025-01-24 05:03:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 05:03:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647448783] [2025-01-24 05:03:58,088 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-24 05:03:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 05:03:58,099 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 218 statements into 101 equivalence classes. [2025-01-24 05:03:58,211 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) and asserted 218 of 218 statements. [2025-01-24 05:03:58,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) [2025-01-24 05:03:58,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:58,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 05:03:58,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-24 05:03:58,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-24 05:03:58,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 05:03:58,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 05:03:58,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 05:03:58,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 05:03:58,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 05:03:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20 [2025-01-24 05:03:58,461 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2] [2025-01-24 05:03:58,462 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/3) [2025-01-24 05:03:58,655 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-24 05:03:58,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-24 05:03:58,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-24 05:03:58,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:03:58 BasicIcfg [2025-01-24 05:03:58,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-24 05:03:58,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-24 05:03:58,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-24 05:03:58,664 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-24 05:03:58,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:10" (3/4) ... [2025-01-24 05:03:58,665 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-24 05:03:58,780 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 211. [2025-01-24 05:03:58,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-01-24 05:03:58,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2025-01-24 05:03:58,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-24 05:03:58,926 INFO L158 Benchmark]: Toolchain (without parser) took 49688.52ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 91.0MB in the beginning and 913.7MB in the end (delta: -822.8MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2025-01-24 05:03:58,930 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory was 61.0MB in the beginning and 60.9MB in the end (delta: 36.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-24 05:03:58,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.59ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 69.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-24 05:03:58,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.53ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 67.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-24 05:03:58,930 INFO L158 Benchmark]: Boogie Preprocessor took 24.26ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 66.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-24 05:03:58,930 INFO L158 Benchmark]: RCFGBuilder took 388.28ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 47.3MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-24 05:03:58,931 INFO L158 Benchmark]: TraceAbstraction took 48422.26ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 46.7MB in the beginning and 958.4MB in the end (delta: -911.7MB). Peak memory consumption was 646.3MB. Max. memory is 16.1GB. [2025-01-24 05:03:58,931 INFO L158 Benchmark]: Witness Printer took 261.54ms. Allocated memory is still 1.1GB. Free memory was 958.4MB in the beginning and 913.7MB in the end (delta: 44.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-24 05:03:58,932 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.33ms. Allocated memory is still 83.9MB. Free memory was 61.0MB in the beginning and 60.9MB in the end (delta: 36.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.59ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 69.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.53ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 67.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.26ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 66.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.28ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 47.3MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48422.26ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 46.7MB in the beginning and 958.4MB in the end (delta: -911.7MB). Peak memory consumption was 646.3MB. Max. memory is 16.1GB. * Witness Printer took 261.54ms. Allocated memory is still 1.1GB. Free memory was 958.4MB in the beginning and 913.7MB in the end (delta: 44.7MB). 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: 26371, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 3248, dependent conditional: 3240, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 291, dependent conditional: 283, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 371, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 331, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 268, dependent conditional: 157, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 23414, independent: 22790, independent conditional: 0, independent unconditional: 22790, dependent: 253, dependent conditional: 207, dependent unconditional: 46, unknown: 371, unknown conditional: 30, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 340, Positive conditional cache size: 7, Positive unconditional cache size: 333, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22837, Maximal queried relation: 11, Independence queries for same thread: 3203, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, 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: 26371, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 3248, dependent conditional: 3240, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 291, dependent conditional: 283, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 371, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 331, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 268, dependent conditional: 157, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 23414, independent: 22790, independent conditional: 0, independent unconditional: 22790, dependent: 253, dependent conditional: 207, dependent unconditional: 46, unknown: 371, unknown conditional: 30, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 340, Positive conditional cache size: 7, Positive unconditional cache size: 333, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22837, Maximal queried relation: 11, Independence queries for same thread: 3203 - 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 [\at(arg, Pre)={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 [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L760] 1 bound = limit [L761] 1 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(arg, Pre)={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 [\at(expression, Pre)=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 [\at(expression, Pre)=0, _N=100, expression=0, limit=100] [L753] 2 reach_error() VAL [\at(expression, Pre)=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: 48.1s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 23.5s, 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: 531, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 260 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 7447 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1676 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 10608/25678 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]: 94, ConditionCalculationTime [ms]: 25, ConditionCalculations: 7, QuantifiedConditions: 0, TraceChecks: 7, UnknownTraceChecks: 0, UnsatisfiedConditions: 7, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-01-24 05:03:58,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE