./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i --full-output --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 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.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 16:39:52,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 16:39:52,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 16:39:52,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 16:39:52,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 16:39:52,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 16:39:52,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 16:39:52,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 16:39:52,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 16:39:52,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 16:39:52,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 16:39:52,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 16:39:52,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 16:39:52,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 16:39:52,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 16:39:52,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 16:39:52,117 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 16:39:52,117 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 16:39:52,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2024-12-17 16:39:52,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 16:39:52,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 16:39:52,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 16:39:52,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 16:39:52,334 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 16:39:52,335 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 [2024-12-17 16:39:53,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/72a21f7fe/1d6b8f18881d4d63bfcdc3b2a98ffc26/FLAGfeae16860 [2024-12-17 16:39:53,732 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 16:39:53,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2024-12-17 16:39:53,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/72a21f7fe/1d6b8f18881d4d63bfcdc3b2a98ffc26/FLAGfeae16860 [2024-12-17 16:39:53,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/72a21f7fe/1d6b8f18881d4d63bfcdc3b2a98ffc26 [2024-12-17 16:39:53,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 16:39:53,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 16:39:53,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 16:39:53,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 16:39:53,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 16:39:53,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 04:39:53" (1/1) ... [2024-12-17 16:39:53,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4005b254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:53, skipping insertion in model container [2024-12-17 16:39:53,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 04:39:53" (1/1) ... [2024-12-17 16:39:53,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 16:39:53,949 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] [2024-12-17 16:39:53,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 16:39:53,970 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 16:39:54,006 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] [2024-12-17 16:39:54,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 16:39:54,032 INFO L204 MainTranslator]: Completed translation [2024-12-17 16:39:54,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54 WrapperNode [2024-12-17 16:39:54,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 16:39:54,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 16:39:54,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 16:39:54,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 16:39:54,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,053 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-12-17 16:39:54,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 16:39:54,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 16:39:54,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 16:39:54,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 16:39:54,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 16:39:54,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 16:39:54,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 16:39:54,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 16:39:54,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (1/1) ... [2024-12-17 16:39:54,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 16:39:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:54,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 16:39:54,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 16:39:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 16:39:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-12-17 16:39:54,111 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-12-17 16:39:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-12-17 16:39:54,111 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-12-17 16:39:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 16:39:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 16:39:54,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 16:39:54,112 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 16:39:54,194 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 16:39:54,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 16:39:54,307 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 16:39:54,307 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 16:39:54,372 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 16:39:54,373 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-17 16:39:54,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 04:39:54 BoogieIcfgContainer [2024-12-17 16:39:54,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 16:39:54,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 16:39:54,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 16:39:54,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 16:39:54,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 04:39:53" (1/3) ... [2024-12-17 16:39:54,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10377e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 04:39:54, skipping insertion in model container [2024-12-17 16:39:54,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 04:39:54" (2/3) ... [2024-12-17 16:39:54,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10377e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 04:39:54, skipping insertion in model container [2024-12-17 16:39:54,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 04:39:54" (3/3) ... [2024-12-17 16:39:54,380 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2024-12-17 16:39:54,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 16:39:54,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-12-17 16:39:54,391 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 16:39:54,429 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-17 16:39:54,463 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 16:39:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 16:39:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:54,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 16:39:54,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 16:39:54,520 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 16:39:54,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2024-12-17 16:39:54,535 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;@41c4f7c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 16:39:54,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 16:39:54,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:54,689 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:54,689 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #1 [2024-12-17 16:39:54,689 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 16:39:54,689 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:54,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 210329393, now seen corresponding path program 1 times [2024-12-17 16:39:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710574581] [2024-12-17 16:39:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:39:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:54,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710574581] [2024-12-17 16:39:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710574581] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 16:39:54,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 16:39:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 16:39:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881922889] [2024-12-17 16:39:54,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 16:39:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 16:39:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:54,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 16:39:54,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-17 16:39:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:54,952 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:54,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 16:39:54,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 16:39:55,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:55,058 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:55,059 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #2 [2024-12-17 16:39:55,059 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:39:55,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:39:55,072 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:55,072 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:39:55,072 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:55,072 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:39:55,072 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:55,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash 261806747, now seen corresponding path program 1 times [2024-12-17 16:39:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494271658] [2024-12-17 16:39:55,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:39:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:55,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:55,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494271658] [2024-12-17 16:39:55,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494271658] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:39:55,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470674407] [2024-12-17 16:39:55,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:55,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:39:55,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-17 16:39:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:39:55,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-17 16:39:55,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:39:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:55,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:39:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:55,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470674407] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:39:55,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:39:55,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-12-17 16:39:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207690406] [2024-12-17 16:39:55,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:39:55,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-17 16:39:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:55,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-17 16:39:55,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-12-17 16:39:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:55,394 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:55,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 16:39:55,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:55,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:55,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-17 16:39:55,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:55,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:55,742 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:55,742 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #3 [2024-12-17 16:39:55,742 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:39:55,742 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:39:55,742 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:55,742 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:39:55,742 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:55,742 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:39:55,742 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:55,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1442144807, now seen corresponding path program 2 times [2024-12-17 16:39:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146994146] [2024-12-17 16:39:55,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:39:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:55,756 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 16:39:55,756 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146994146] [2024-12-17 16:39:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146994146] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:39:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183592728] [2024-12-17 16:39:55,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:39:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:55,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:39:55,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-17 16:39:55,922 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 16:39:55,922 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:55,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 16:39:55,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:39:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:56,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:39:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183592728] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:39:56,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:39:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-12-17 16:39:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386555378] [2024-12-17 16:39:56,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:39:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-17 16:39:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:56,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-17 16:39:56,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-12-17 16:39:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:56,168 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:56,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 16:39:56,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:56,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:56,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:56,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-17 16:39:56,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:56,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:56,628 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:56,628 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #4 [2024-12-17 16:39:56,628 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:39:56,628 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:39:56,628 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:56,628 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:39:56,628 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:56,628 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:39:56,628 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:56,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1581428523, now seen corresponding path program 3 times [2024-12-17 16:39:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:56,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395495720] [2024-12-17 16:39:56,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 16:39:56,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:56,638 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-17 16:39:56,638 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-12-17 16:39:56,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395495720] [2024-12-17 16:39:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395495720] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:39:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135998467] [2024-12-17 16:39:56,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 16:39:56,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:56,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:56,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:39:56,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-17 16:39:56,766 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-17 16:39:56,767 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:56,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 16:39:56,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:39:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-12-17 16:39:56,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 16:39:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135998467] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 16:39:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-17 16:39:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-12-17 16:39:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893632747] [2024-12-17 16:39:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 16:39:56,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 16:39:56,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:56,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 16:39:56,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-17 16:39:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:56,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:56,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 16:39:56,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:56,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:56,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:56,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-12-17 16:39:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:57,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:57,309 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:57,309 INFO L139 ounterexampleChecker]: Examining path program with hash 1535588422, occurence #1 [2024-12-17 16:39:57,309 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 16:39:57,309 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash 999831025, now seen corresponding path program 2 times [2024-12-17 16:39:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936142223] [2024-12-17 16:39:57,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:39:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:57,315 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-17 16:39:57,316 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936142223] [2024-12-17 16:39:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936142223] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 16:39:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 16:39:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 16:39:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417575970] [2024-12-17 16:39:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 16:39:57,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 16:39:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:57,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 16:39:57,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-17 16:39:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:57,374 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:57,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 16:39:57,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:57,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:57,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:39:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-17 16:39:57,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:57,469 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:57,469 INFO L139 ounterexampleChecker]: Examining path program with hash 1535588422, occurence #2 [2024-12-17 16:39:57,469 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:39:57,469 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:39:57,470 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:57,470 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:39:57,470 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:57,470 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:39:57,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956904, now seen corresponding path program 1 times [2024-12-17 16:39:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:39:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522268626] [2024-12-17 16:39:57,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:39:57,492 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:39:57,493 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:39:57,493 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:39:57,493 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1236336293, now seen corresponding path program 4 times [2024-12-17 16:39:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:57,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400887637] [2024-12-17 16:39:57,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 16:39:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:57,500 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 16:39:57,500 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-17 16:39:57,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:57,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400887637] [2024-12-17 16:39:57,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400887637] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:39:57,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55592787] [2024-12-17 16:39:57,607 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 16:39:57,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:57,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:57,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:39:57,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-17 16:39:57,655 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 16:39:57,655 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:57,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 16:39:57,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:39:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:57,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:39:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:39:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55592787] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:39:57,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:39:57,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-12-17 16:39:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538196418] [2024-12-17 16:39:57,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:39:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-17 16:39:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:57,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-17 16:39:57,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-12-17 16:39:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:57,809 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:57,812 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) [2024-12-17 16:39:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:39:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:39:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:39:58,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-17 16:39:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:58,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:58,402 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:58,402 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #1 [2024-12-17 16:39:58,402 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 16:39:58,402 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 448656802, now seen corresponding path program 1 times [2024-12-17 16:39:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:58,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938639838] [2024-12-17 16:39:58,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:39:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:39:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938639838] [2024-12-17 16:39:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938639838] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:39:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544325138] [2024-12-17 16:39:58,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:58,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:39:58,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-17 16:39:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:39:58,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 16:39:58,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:39:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:39:58,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:39:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:39:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544325138] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:39:58,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:39:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-12-17 16:39:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876221018] [2024-12-17 16:39:58,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:39:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-17 16:39:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:58,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-17 16:39:58,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-12-17 16:39:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:58,632 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:58,633 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) [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:39:58,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:39:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:39:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:39:58,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-17 16:39:59,104 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 [2024-12-17 16:39:59,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:39:59,104 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:39:59,105 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #2 [2024-12-17 16:39:59,105 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:39:59,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:39:59,105 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:59,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:39:59,105 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:39:59,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:39:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956891, now seen corresponding path program 1 times [2024-12-17 16:39:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:39:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594046220] [2024-12-17 16:39:59,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:39:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:39:59,119 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:39:59,120 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:39:59,120 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:39:59,120 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:39:59,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:39:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1343796150, now seen corresponding path program 2 times [2024-12-17 16:39:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:39:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505534080] [2024-12-17 16:39:59,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:39:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:39:59,127 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 16:39:59,127 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:39:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:39:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505534080] [2024-12-17 16:39:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505534080] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:39:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484438870] [2024-12-17 16:39:59,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:39:59,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:39:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:39:59,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:39:59,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-17 16:39:59,294 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 16:39:59,294 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:39:59,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-17 16:39:59,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:39:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:39:59,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:39:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:39:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484438870] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:39:59,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:39:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-12-17 16:39:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984889545] [2024-12-17 16:39:59,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:39:59,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-17 16:39:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:39:59,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-17 16:39:59,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2024-12-17 16:39:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:39:59,548 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:39:59,548 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) [2024-12-17 16:39:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:39:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:39:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:39:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:39:59,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:39:59,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:39:59,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:00,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-17 16:40:00,262 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 [2024-12-17 16:40:00,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:40:00,263 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:40:00,263 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #3 [2024-12-17 16:40:00,263 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:40:00,263 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:40:00,263 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:00,263 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:40:00,263 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:00,263 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:40:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956882, now seen corresponding path program 1 times [2024-12-17 16:40:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:40:00,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952421480] [2024-12-17 16:40:00,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:40:00,280 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:40:00,280 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:40:00,280 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:40:00,280 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:40:00,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2038071706, now seen corresponding path program 3 times [2024-12-17 16:40:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:40:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284813229] [2024-12-17 16:40:00,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 16:40:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:00,289 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-12-17 16:40:00,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-12-17 16:40:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:40:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284813229] [2024-12-17 16:40:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284813229] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:40:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005035881] [2024-12-17 16:40:00,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 16:40:00,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:40:00,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:40:00,386 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:40:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-17 16:40:00,432 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-12-17 16:40:00,433 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:00,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-17 16:40:00,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:40:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-12-17 16:40:00,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 16:40:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005035881] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 16:40:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-17 16:40:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-12-17 16:40:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148990335] [2024-12-17 16:40:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 16:40:00,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 16:40:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:40:00,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 16:40:00,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-17 16:40:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:00,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:40:00,491 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) [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:00,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-12-17 16:40:00,838 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 [2024-12-17 16:40:00,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:40:00,838 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:40:00,838 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #1 [2024-12-17 16:40:00,838 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 16:40:00,838 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:40:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1706546089, now seen corresponding path program 1 times [2024-12-17 16:40:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:40:00,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016719976] [2024-12-17 16:40:00,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:00,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:40:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:40:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:40:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016719976] [2024-12-17 16:40:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016719976] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:40:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813364765] [2024-12-17 16:40:01,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:40:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:40:01,149 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:40:01,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-17 16:40:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 16:40:01,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-17 16:40:01,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:40:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:40:01,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:40:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:40:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813364765] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:40:01,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:40:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2024-12-17 16:40:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196730584] [2024-12-17 16:40:01,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:40:01,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-12-17 16:40:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:40:01,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-12-17 16:40:01,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=1751, Unknown=0, NotChecked=0, Total=2756 [2024-12-17 16:40:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:01,810 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:40:01,810 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) [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:01,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:03,079 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 [2024-12-17 16:40:03,273 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 [2024-12-17 16:40:03,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:40:03,274 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:40:03,274 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #2 [2024-12-17 16:40:03,274 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:40:03,274 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:40:03,274 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:03,274 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:40:03,274 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:03,274 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:40:03,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956871, now seen corresponding path program 1 times [2024-12-17 16:40:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:40:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466956358] [2024-12-17 16:40:03,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:40:03,286 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:40:03,286 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:40:03,286 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:40:03,286 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:40:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash 215020983, now seen corresponding path program 2 times [2024-12-17 16:40:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:40:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98476842] [2024-12-17 16:40:03,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:40:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:03,301 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 16:40:03,301 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:40:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:40:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98476842] [2024-12-17 16:40:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98476842] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:40:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713487646] [2024-12-17 16:40:04,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 16:40:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:40:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:40:04,068 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:40:04,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-17 16:40:04,125 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 16:40:04,125 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-12-17 16:40:04,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:40:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:40:04,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:40:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 16:40:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713487646] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:40:06,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:40:06,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35, 35] total 102 [2024-12-17 16:40:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407265770] [2024-12-17 16:40:06,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:40:06,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-12-17 16:40:06,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:40:06,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-12-17 16:40:06,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2625, Invalid=7881, Unknown=0, NotChecked=0, Total=10506 [2024-12-17 16:40:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:06,290 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:40:06,290 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) [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:06,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2024-12-17 16:40:16,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-17 16:40:16,995 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 [2024-12-17 16:40:16,995 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:40:16,995 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:40:16,995 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #3 [2024-12-17 16:40:16,995 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:40:16,995 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:40:16,995 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:16,995 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:40:16,995 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:16,995 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:40:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956862, now seen corresponding path program 1 times [2024-12-17 16:40:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:40:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552776908] [2024-12-17 16:40:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:40:17,006 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:40:17,007 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:40:17,007 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:40:17,007 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:40:17,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1570109321, now seen corresponding path program 3 times [2024-12-17 16:40:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:40:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025829877] [2024-12-17 16:40:17,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 16:40:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:17,055 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2024-12-17 16:40:17,055 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:40:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:40:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025829877] [2024-12-17 16:40:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025829877] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 16:40:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662427787] [2024-12-17 16:40:19,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 16:40:19,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 16:40:19,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 16:40:19,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 16:40:19,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-17 16:40:19,183 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2024-12-17 16:40:19,183 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:19,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-12-17 16:40:19,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 16:40:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:40:20,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 16:40:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 16:40:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662427787] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 16:40:23,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 16:40:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 172 [2024-12-17 16:40:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814716948] [2024-12-17 16:40:23,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 16:40:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 173 states [2024-12-17 16:40:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:40:23,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2024-12-17 16:40:23,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11860, Invalid=17896, Unknown=0, NotChecked=0, Total=29756 [2024-12-17 16:40:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:23,828 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:40:23,828 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) [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2024-12-17 16:40:23,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2024-12-17 16:40:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-12-17 16:40:28,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-17 16:40:28,533 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 [2024-12-17 16:40:28,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:40:28,534 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:40:28,534 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #4 [2024-12-17 16:40:28,534 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:40:28,534 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:40:28,534 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:28,534 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:40:28,534 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:28,534 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:40:28,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956853, now seen corresponding path program 1 times [2024-12-17 16:40:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:40:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332145408] [2024-12-17 16:40:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:40:28,545 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:40:28,545 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:40:28,545 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:40:28,545 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:40:28,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2118994875, now seen corresponding path program 4 times [2024-12-17 16:40:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:40:28,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094386934] [2024-12-17 16:40:28,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 16:40:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:28,693 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 16:40:28,693 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 16:40:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10003 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10000 trivial. 0 not checked. [2024-12-17 16:40:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 16:40:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094386934] [2024-12-17 16:40:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094386934] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 16:40:31,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 16:40:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-17 16:40:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782290202] [2024-12-17 16:40:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 16:40:31,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-17 16:40:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 16:40:31,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-17 16:40:31,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-17 16:40:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:31,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 16:40:31,960 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) [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-12-17 16:40:31,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2024-12-17 16:40:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-12-17 16:40:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-17 16:40:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable17 [2024-12-17 16:40:32,092 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 16:40:32,092 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 16:40:32,092 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #5 [2024-12-17 16:40:32,092 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 16:40:32,092 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 16:40:32,092 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:32,092 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 16:40:32,092 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 16:40:32,092 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2024-12-17 16:40:32,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956846, now seen corresponding path program 1 times [2024-12-17 16:40:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-12-17 16:40:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041751420] [2024-12-17 16:40:32,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 16:40:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:40:32,103 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2024-12-17 16:40:32,103 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2024-12-17 16:40:32,103 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 16:40:32,103 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 16:40:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 16:40:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1097176859, now seen corresponding path program 5 times [2024-12-17 16:40:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 16:40:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932587680] [2024-12-17 16:40:32,104 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-17 16:40:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 16:40:32,187 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) [2024-12-17 16:40:32,188 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-17 16:40:32,188 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 16:40:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 16:40:32,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 16:40:32,351 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 16:40:32,352 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 16:40:32,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20 [2024-12-17 16:40:32,356 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2] [2024-12-17 16:40:32,357 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/3) [2024-12-17 16:40:32,489 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-17 16:40:32,489 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-17 16:40:32,499 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 [2024-12-17 16:40:32,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 04:40:32 BasicIcfg [2024-12-17 16:40:32,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-17 16:40:32,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-17 16:40:32,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-17 16:40:32,500 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-17 16:40:32,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 04:39:54" (3/4) ... [2024-12-17 16:40:32,501 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-17 16:40:32,593 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 211. [2024-12-17 16:40:32,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-12-17 16:40:32,672 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2024-12-17 16:40:32,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-17 16:40:32,672 INFO L158 Benchmark]: Toolchain (without parser) took 38918.26ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 132.2MB in the beginning and 968.4MB in the end (delta: -836.2MB). Peak memory consumption was 154.1MB. Max. memory is 16.1GB. [2024-12-17 16:40:32,673 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-17 16:40:32,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.98ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 111.9MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-17 16:40:32,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.94ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-17 16:40:32,673 INFO L158 Benchmark]: Boogie Preprocessor took 16.48ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 109.3MB in the end (delta: 960.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-17 16:40:32,673 INFO L158 Benchmark]: RCFGBuilder took 302.80ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 89.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-17 16:40:32,673 INFO L158 Benchmark]: TraceAbstraction took 38124.73ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 89.0MB in the beginning and 1.0GB in the end (delta: -924.6MB). Peak memory consumption was 674.1MB. Max. memory is 16.1GB. [2024-12-17 16:40:32,674 INFO L158 Benchmark]: Witness Printer took 172.30ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 968.4MB in the end (delta: 45.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-12-17 16:40:32,676 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.98ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 111.9MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.94ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.48ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 109.3MB in the end (delta: 960.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 302.80ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 89.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 38124.73ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 89.0MB in the beginning and 1.0GB in the end (delta: -924.6MB). Peak memory consumption was 674.1MB. Max. memory is 16.1GB. * Witness Printer took 172.30ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 968.4MB in the end (delta: 45.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 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: 274, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 222, dependent conditional: 127, dependent unconditional: 95, 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: 274, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 222, dependent conditional: 127, dependent unconditional: 95, 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 [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L760] 1 bound = limit [L761] 1 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L761] COND FALSE 1 !(i < bound) [L762] CALL 1 __VERIFIER_assert(i == lim) [L753] COND FALSE 1 !(!expression) VAL [\old(expression)=1, _N=100, expression=1, limit=100] [L762] RET 1 __VERIFIER_assert(i == lim) [L763] 1 return 0; [L780] FCALL, JOIN 1 pthread_join(t1, 0) VAL [_N=100, limit=100, t1=0, t2=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=100, expression=0, limit=100] [L753] 2 reach_error() VAL [\old(expression)=0, _N=100, expression=0, limit=100] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 18.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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.5s SatisfiabilityAnalysisTime, 15.6s 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]: 111, ConditionCalculationTime [ms]: 59, ConditionCalculations: 7, QuantifiedConditions: 0, TraceChecks: 7, UnknownTraceChecks: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-12-17 16:40:32,693 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