./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lamport.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:51:59,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:51:59,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:51:59,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:51:59,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:51:59,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:51:59,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:51:59,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:51:59,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:51:59,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:51:59,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:51:59,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:51:59,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:51:59,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:51:59,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:51:59,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:51:59,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:51:59,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:51:59,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:51:59,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:51:59,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:51:59,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:51:59,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:51:59,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:51:59,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:51:59,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:59,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:51:59,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:51:59,319 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:51:59,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:51:59,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:51:59,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:51:59,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:51:59,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:51:59,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:51:59,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:51:59,320 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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 -> Automizer 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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2025-02-05 16:51:59,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:51:59,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:51:59,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:51:59,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:51:59,620 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:51:59,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-02-05 16:52:00,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f1792697/3ff8ec6e20144b749f07f8e46fa259bf/FLAGa568fa499 [2025-02-05 16:52:01,268 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:52:01,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-02-05 16:52:01,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f1792697/3ff8ec6e20144b749f07f8e46fa259bf/FLAGa568fa499 [2025-02-05 16:52:01,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f1792697/3ff8ec6e20144b749f07f8e46fa259bf [2025-02-05 16:52:01,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:52:01,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:52:01,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:01,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:52:01,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:52:01,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:01,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01, skipping insertion in model container [2025-02-05 16:52:01,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:01,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:52:01,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i[23604,23617] [2025-02-05 16:52:01,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:01,801 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:52:01,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i[23604,23617] [2025-02-05 16:52:01,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:01,926 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:52:01,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01 WrapperNode [2025-02-05 16:52:01,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:01,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:01,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:52:01,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:52:01,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:01,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:01,980 INFO L138 Inliner]: procedures = 145, calls = 360, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 471 [2025-02-05 16:52:01,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:01,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:52:01,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:52:01,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:52:01,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:01,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:01,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,043 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 6, 8, 8, 8, 29, 21, 13, 7, 7, 5, 7, 7, 7, 5, 5, 0, 5, 13, 5]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 2, 3, 3, 3, 9, 9, 0, 3, 3, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0]. The 42 writes are split as follows [0, 2, 2, 2, 2, 11, 6, 1, 2, 2, 1, 2, 2, 2, 1, 1, 0, 1, 1, 1]. [2025-02-05 16:52:02,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:52:02,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:52:02,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:52:02,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:52:02,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (1/1) ... [2025-02-05 16:52:02,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:02,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:02,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:52:02,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:52:02,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:52:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:52:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:52:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:52:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:52:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:52:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:52:02,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:52:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:52:02,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:52:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:52:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:52:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:52:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:52:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:52:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:52:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:52:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:52:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:52:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:52:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:52:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:52:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:52:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:52:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:52:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:52:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:52:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 16:52:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:52:02,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:52:02,476 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:52:02,480 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:52:03,962 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-05 16:52:03,962 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:52:03,974 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:52:03,976 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:52:03,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:03 BoogieIcfgContainer [2025-02-05 16:52:03,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:52:03,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:52:03,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:52:03,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:52:03,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:52:01" (1/3) ... [2025-02-05 16:52:03,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3055db0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:03, skipping insertion in model container [2025-02-05 16:52:03,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:01" (2/3) ... [2025-02-05 16:52:03,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3055db0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:03, skipping insertion in model container [2025-02-05 16:52:03,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:03" (3/3) ... [2025-02-05 16:52:03,989 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2025-02-05 16:52:04,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:52:04,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lamport.i that has 6 procedures, 114 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:52:04,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:52:04,065 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=PETRI_NET, 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;@6077d4c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:52:04,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:52:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 16:52:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:52:04,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:04,084 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:04,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 833356980, now seen corresponding path program 1 times [2025-02-05 16:52:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303987029] [2025-02-05 16:52:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:04,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:52:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:52:04,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:52:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303987029] [2025-02-05 16:52:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303987029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:04,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:04,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416095419] [2025-02-05 16:52:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:04,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:04,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:04,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:04,928 INFO L87 Difference]: Start difference. First operand has 114 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 16:52:08,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:09,042 INFO L93 Difference]: Finished difference Result 226 states and 360 transitions. [2025-02-05 16:52:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-02-05 16:52:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:09,055 INFO L225 Difference]: With dead ends: 226 [2025-02-05 16:52:09,055 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 16:52:09,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:09,065 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:09,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 16:52:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 16:52:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-02-05 16:52:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 16:52:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-02-05 16:52:09,113 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 143 [2025-02-05 16:52:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:09,113 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-02-05 16:52:09,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 16:52:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-02-05 16:52:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:52:09,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:09,124 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:52:09,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 897982048, now seen corresponding path program 1 times [2025-02-05 16:52:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981936963] [2025-02-05 16:52:09,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:52:09,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:52:09,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:52:09,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:09,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981936963] [2025-02-05 16:52:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981936963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:09,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:09,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171184033] [2025-02-05 16:52:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:09,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:09,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:09,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:09,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:09,548 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 16:52:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:09,595 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2025-02-05 16:52:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:09,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-02-05 16:52:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:09,598 INFO L225 Difference]: With dead ends: 220 [2025-02-05 16:52:09,598 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 16:52:09,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:09,601 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:09,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 16:52:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 16:52:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 16:52:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-02-05 16:52:09,622 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 145 [2025-02-05 16:52:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:09,622 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-02-05 16:52:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 16:52:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-02-05 16:52:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:52:09,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:09,628 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:09,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:52:09,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:09,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1238924687, now seen corresponding path program 1 times [2025-02-05 16:52:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:09,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394293381] [2025-02-05 16:52:09,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:09,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:52:09,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:52:09,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:52:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:10,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394293381] [2025-02-05 16:52:10,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394293381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:10,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361212504] [2025-02-05 16:52:10,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:10,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:10,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:10,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:10,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:52:10,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:52:10,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:52:10,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:10,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:10,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:52:10,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 16:52:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361212504] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:10,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:52:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883550871] [2025-02-05 16:52:10,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:10,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:52:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:10,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:52:10,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:10,947 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 16:52:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:10,992 INFO L93 Difference]: Finished difference Result 223 states and 321 transitions. [2025-02-05 16:52:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:52:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 146 [2025-02-05 16:52:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:10,994 INFO L225 Difference]: With dead ends: 223 [2025-02-05 16:52:10,994 INFO L226 Difference]: Without dead ends: 114 [2025-02-05 16:52:10,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:10,996 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:10,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 465 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-05 16:52:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-05 16:52:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 16:52:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-02-05 16:52:11,007 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 146 [2025-02-05 16:52:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:11,007 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-02-05 16:52:11,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 16:52:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-02-05 16:52:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:52:11,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:11,009 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:11,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:11,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 151606191, now seen corresponding path program 2 times [2025-02-05 16:52:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306663071] [2025-02-05 16:52:11,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:11,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-05 16:52:11,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 148 statements. [2025-02-05 16:52:11,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-02-05 16:52:11,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306663071] [2025-02-05 16:52:11,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306663071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:11,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:11,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:11,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80153568] [2025-02-05 16:52:11,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:11,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:11,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:11,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:11,565 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 16:52:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:11,618 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-02-05 16:52:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:11,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-02-05 16:52:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:11,625 INFO L225 Difference]: With dead ends: 218 [2025-02-05 16:52:11,626 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 16:52:11,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:11,627 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 99 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:11,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 490 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 16:52:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-02-05 16:52:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-05 16:52:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2025-02-05 16:52:11,659 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 148 [2025-02-05 16:52:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:11,660 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2025-02-05 16:52:11,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 16:52:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2025-02-05 16:52:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 16:52:11,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:11,665 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:11,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:52:11,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:11,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1527820512, now seen corresponding path program 1 times [2025-02-05 16:52:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128516185] [2025-02-05 16:52:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:11,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 16:52:11,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 16:52:11,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:11,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-02-05 16:52:12,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:12,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128516185] [2025-02-05 16:52:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128516185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:12,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197478170] [2025-02-05 16:52:12,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:12,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:12,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:12,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:12,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:52:12,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 16:52:12,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 16:52:12,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:12,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:12,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:12,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-02-05 16:52:12,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-02-05 16:52:13,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197478170] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:13,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:13,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:52:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564195819] [2025-02-05 16:52:13,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:13,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:52:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:13,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:52:13,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:13,140 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-02-05 16:52:17,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:20,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:21,367 INFO L93 Difference]: Finished difference Result 338 states and 486 transitions. [2025-02-05 16:52:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:52:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 217 [2025-02-05 16:52:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:21,412 INFO L225 Difference]: With dead ends: 338 [2025-02-05 16:52:21,412 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 16:52:21,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 431 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:21,415 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:21,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2025-02-05 16:52:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 16:52:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-02-05 16:52:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 118 states have internal predecessors, (151), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-05 16:52:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2025-02-05 16:52:21,436 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 217 [2025-02-05 16:52:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:21,436 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2025-02-05 16:52:21,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-02-05 16:52:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2025-02-05 16:52:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 16:52:21,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:21,440 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:21,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:52:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:21,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:21,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash 208227200, now seen corresponding path program 2 times [2025-02-05 16:52:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426167723] [2025-02-05 16:52:21,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:21,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 227 statements into 2 equivalence classes. [2025-02-05 16:52:21,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 227 statements. [2025-02-05 16:52:21,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:21,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-02-05 16:52:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426167723] [2025-02-05 16:52:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426167723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:22,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:22,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930079608] [2025-02-05 16:52:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:22,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:22,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:22,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:22,131 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 16:52:23,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:27,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:27,669 INFO L93 Difference]: Finished difference Result 472 states and 679 transitions. [2025-02-05 16:52:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 227 [2025-02-05 16:52:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:27,673 INFO L225 Difference]: With dead ends: 472 [2025-02-05 16:52:27,673 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 16:52:27,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:27,676 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:27,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 661 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 16:52:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 16:52:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2025-02-05 16:52:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 208 states have (on average 1.2740384615384615) internal successors, (265), 208 states have internal predecessors, (265), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-02-05 16:52:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2025-02-05 16:52:27,706 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 227 [2025-02-05 16:52:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2025-02-05 16:52:27,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 16:52:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2025-02-05 16:52:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 16:52:27,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:27,710 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:27,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:52:27,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:27,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1941747774, now seen corresponding path program 1 times [2025-02-05 16:52:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367155367] [2025-02-05 16:52:27,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:27,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:27,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 16:52:27,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 16:52:27,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:27,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-02-05 16:52:28,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:28,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367155367] [2025-02-05 16:52:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367155367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:28,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:28,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298722859] [2025-02-05 16:52:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:28,618 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 16:52:33,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:33,558 INFO L93 Difference]: Finished difference Result 594 states and 849 transitions. [2025-02-05 16:52:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 227 [2025-02-05 16:52:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:33,564 INFO L225 Difference]: With dead ends: 594 [2025-02-05 16:52:33,564 INFO L226 Difference]: Without dead ends: 298 [2025-02-05 16:52:33,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:33,566 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 138 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:33,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 16:52:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-05 16:52:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2025-02-05 16:52:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 189 states have (on average 1.2328042328042328) internal successors, (233), 189 states have internal predecessors, (233), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (94), 86 states have call predecessors, (94), 86 states have call successors, (94) [2025-02-05 16:52:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 413 transitions. [2025-02-05 16:52:33,612 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 413 transitions. Word has length 227 [2025-02-05 16:52:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:33,612 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 413 transitions. [2025-02-05 16:52:33,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 16:52:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 413 transitions. [2025-02-05 16:52:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 16:52:33,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:33,623 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:33,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:52:33,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:33,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:33,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1680140100, now seen corresponding path program 1 times [2025-02-05 16:52:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:33,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095067506] [2025-02-05 16:52:33,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:33,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:33,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 16:52:33,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 16:52:33,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-02-05 16:52:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095067506] [2025-02-05 16:52:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095067506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608829463] [2025-02-05 16:52:34,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:34,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:34,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:34,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:34,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:52:34,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 16:52:35,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 16:52:35,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:35,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:35,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:52:35,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-02-05 16:52:35,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-02-05 16:52:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608829463] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:36,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-05 16:52:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068887233] [2025-02-05 16:52:36,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:36,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:52:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:36,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:52:36,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:52:36,050 INFO L87 Difference]: Start difference. First operand 294 states and 413 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-02-05 16:52:37,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:38,140 INFO L93 Difference]: Finished difference Result 586 states and 836 transitions. [2025-02-05 16:52:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:52:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 227 [2025-02-05 16:52:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:38,145 INFO L225 Difference]: With dead ends: 586 [2025-02-05 16:52:38,147 INFO L226 Difference]: Without dead ends: 316 [2025-02-05 16:52:38,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:52:38,150 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 167 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:38,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 469 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:52:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-02-05 16:52:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-02-05 16:52:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 209 states have internal predecessors, (260), 77 states have call successors, (77), 26 states have call predecessors, (77), 28 states have return successors, (97), 77 states have call predecessors, (97), 77 states have call successors, (97) [2025-02-05 16:52:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 434 transitions. [2025-02-05 16:52:38,180 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 434 transitions. Word has length 227 [2025-02-05 16:52:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:38,180 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 434 transitions. [2025-02-05 16:52:38,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-02-05 16:52:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2025-02-05 16:52:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 16:52:38,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:38,186 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:38,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:38,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:38,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1140018300, now seen corresponding path program 1 times [2025-02-05 16:52:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:38,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216760352] [2025-02-05 16:52:38,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:38,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 16:52:38,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 16:52:38,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:38,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-02-05 16:52:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216760352] [2025-02-05 16:52:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216760352] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385594942] [2025-02-05 16:52:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:41,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:41,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:52:41,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 16:52:41,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 16:52:41,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:41,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:41,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 16:52:41,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:41,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-05 16:52:41,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:52:42,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_old(~__CS_thread_index~0)| 1))) (or (= .cse0 (select (select |c_#memory_int#1| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (exists ((|v_old(#memory_int#1)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (not (= .cse1 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse0 (select (select |v_old(#memory_int#1)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))))))) is different from false [2025-02-05 16:52:42,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_old(~__CS_thread_index~0)| 1))) (or (= .cse0 (select (select |c_#memory_int#1| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (exists ((|v_old(#memory_int#1)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (not (= .cse1 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse0 (select (select |v_old(#memory_int#1)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))))))) is different from true [2025-02-05 16:52:42,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-05 16:52:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-02-05 16:52:42,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:42,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:52:42,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-05 16:52:42,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 16:52:42,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-05 16:52:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385594942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:43,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 16:52:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2025-02-05 16:52:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727914827] [2025-02-05 16:52:43,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:43,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:52:43,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:43,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:52:43,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=769, Unknown=6, NotChecked=56, Total=930 [2025-02-05 16:52:43,412 INFO L87 Difference]: Start difference. First operand 313 states and 434 transitions. Second operand has 26 states, 24 states have (on average 3.375) internal successors, (81), 22 states have internal predecessors, (81), 12 states have call successors, (59), 5 states have call predecessors, (59), 9 states have return successors, (60), 10 states have call predecessors, (60), 12 states have call successors, (60) [2025-02-05 16:52:47,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:51,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:55,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:59,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:03,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:07,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:11,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:12,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_old(~__CS_thread_index~0)| 1))) (let ((.cse0 (= .cse2 (select (select |c_#memory_int#1| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)))) (and (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) .cse0 (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (not (= .cse1 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse2 (select (select |v_old(#memory_int#1)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))))))))) is different from false [2025-02-05 16:53:12,328 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_old(~__CS_thread_index~0)| 1))) (let ((.cse0 (= .cse2 (select (select |c_#memory_int#1| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)))) (and (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) .cse0 (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (not (= .cse1 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse2 (select (select |v_old(#memory_int#1)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))))))))) is different from true [2025-02-05 16:53:14,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_old(~__CS_thread_index~0)| 1)) (.cse2 (select (select |c_#memory_int#1| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))) (let ((.cse0 (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|))) (.cse1 (= .cse4 .cse2))) (and .cse0 .cse1 (or (and (= c_~__CS_thread_index~0 1) .cse0 (= .cse2 1)) (not (= |c_old(~__CS_thread_index~0)| 0))) (or .cse1 (exists ((|v_old(#memory_int#1)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_8| .cse3 (select |c_#memory_int#1| .cse3))) (not (= .cse3 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse4 (select (select |v_old(#memory_int#1)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))))))))) is different from false [2025-02-05 16:53:14,709 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_old(~__CS_thread_index~0)| 1)) (.cse2 (select (select |c_#memory_int#1| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))) (let ((.cse0 (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|))) (.cse1 (= .cse4 .cse2))) (and .cse0 .cse1 (or (and (= c_~__CS_thread_index~0 1) .cse0 (= .cse2 1)) (not (= |c_old(~__CS_thread_index~0)| 0))) (or .cse1 (exists ((|v_old(#memory_int#1)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_8| .cse3 (select |c_#memory_int#1| .cse3))) (not (= .cse3 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse4 (select (select |v_old(#memory_int#1)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))))))))) is different from true [2025-02-05 16:53:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:15,499 INFO L93 Difference]: Finished difference Result 487 states and 692 transitions. [2025-02-05 16:53:15,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 16:53:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.375) internal successors, (81), 22 states have internal predecessors, (81), 12 states have call successors, (59), 5 states have call predecessors, (59), 9 states have return successors, (60), 10 states have call predecessors, (60), 12 states have call successors, (60) Word has length 227 [2025-02-05 16:53:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:15,514 INFO L225 Difference]: With dead ends: 487 [2025-02-05 16:53:15,514 INFO L226 Difference]: Without dead ends: 340 [2025-02-05 16:53:15,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=313, Invalid=1945, Unknown=10, NotChecked=282, Total=2550 [2025-02-05 16:53:15,516 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 259 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 266 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:15,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1011 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1598 Invalid, 7 Unknown, 306 Unchecked, 30.9s Time] [2025-02-05 16:53:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-05 16:53:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 329. [2025-02-05 16:53:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 221 states have internal predecessors, (271), 80 states have call successors, (80), 26 states have call predecessors, (80), 32 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2025-02-05 16:53:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 467 transitions. [2025-02-05 16:53:15,587 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 467 transitions. Word has length 227 [2025-02-05 16:53:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:15,587 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 467 transitions. [2025-02-05 16:53:15,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.375) internal successors, (81), 22 states have internal predecessors, (81), 12 states have call successors, (59), 5 states have call predecessors, (59), 9 states have return successors, (60), 10 states have call predecessors, (60), 12 states have call successors, (60) [2025-02-05 16:53:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 467 transitions. [2025-02-05 16:53:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:53:15,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:15,597 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:15,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:53:15,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 16:53:15,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:15,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1740076204, now seen corresponding path program 1 times [2025-02-05 16:53:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:15,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389825619] [2025-02-05 16:53:15,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:16,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:53:16,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:53:16,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:16,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-02-05 16:53:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389825619] [2025-02-05 16:53:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389825619] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046177611] [2025-02-05 16:53:19,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:19,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:53:19,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:53:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:53:20,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:20,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:20,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 16:53:20,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:20,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9