./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_time_var_mutex.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 d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:42,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:42,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:42,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:42,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:42,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:42,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:42,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:42,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:42,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:42,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:42,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:42,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:42,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:42,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:42,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:42,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:42,069 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 -> d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef [2025-02-07 21:25:42,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:42,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:42,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:42,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:42,264 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:42,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-02-07 21:25:43,386 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df8a04a4d/d00902bd985a4370bfd8853ac7841d97/FLAGa0aba4269 [2025-02-07 21:25:43,707 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:43,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-02-07 21:25:43,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df8a04a4d/d00902bd985a4370bfd8853ac7841d97/FLAGa0aba4269 [2025-02-07 21:25:43,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df8a04a4d/d00902bd985a4370bfd8853ac7841d97 [2025-02-07 21:25:43,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:43,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:43,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:43,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:43,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:43,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:43" (1/1) ... [2025-02-07 21:25:43,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149051e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:43, skipping insertion in model container [2025-02-07 21:25:43,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:43" (1/1) ... [2025-02-07 21:25:44,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:44,224 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_time_var_mutex.i[23611,23624] [2025-02-07 21:25:44,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:44,340 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:44,370 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_time_var_mutex.i[23611,23624] [2025-02-07 21:25:44,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:44,450 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:44,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44 WrapperNode [2025-02-07 21:25:44,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:44,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:44,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:44,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:44,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,504 INFO L138 Inliner]: procedures = 145, calls = 326, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 529 [2025-02-07 21:25:44,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:44,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:44,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:44,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:44,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,557 INFO L175 MemorySlicer]: Split 173 memory accesses to 19 slices as follows [2, 8, 0, 8, 8, 29, 13, 5, 21, 7, 17, 8, 8, 6, 5, 5, 5, 13, 5]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 3, 0, 3, 3, 9, 0, 0, 9, 3, 6, 3, 3, 2, 0, 0, 0, 0, 0]. The 43 writes are split as follows [0, 2, 0, 2, 2, 11, 1, 1, 6, 2, 5, 2, 2, 2, 1, 1, 1, 1, 1]. [2025-02-07 21:25:44,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:44,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:44,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:44,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:44,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:44,651 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-07 21:25:44,662 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-07 21:25:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:44,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:44,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:44,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-02-07 21:25:44,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:44,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-07 21:25:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:44,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_destroy [2025-02-07 21:25:44,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_destroy [2025-02-07 21:25:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:44,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:44,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:44,926 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:45,991 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:45,991 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:46,000 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:46,003 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:46,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:46 BoogieIcfgContainer [2025-02-07 21:25:46,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:46,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:46,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:46,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:43" (1/3) ... [2025-02-07 21:25:46,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1502095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:46, skipping insertion in model container [2025-02-07 21:25:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (2/3) ... [2025-02-07 21:25:46,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1502095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:46, skipping insertion in model container [2025-02-07 21:25:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:46" (3/3) ... [2025-02-07 21:25:46,009 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_time_var_mutex.i [2025-02-07 21:25:46,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:46,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_time_var_mutex.i that has 8 procedures, 141 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:46,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:46,071 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;@534b6a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:46,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 88 states have internal predecessors, (115), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-07 21:25:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-07 21:25:46,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:46,087 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] [2025-02-07 21:25:46,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -751942946, now seen corresponding path program 1 times [2025-02-07 21:25:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146216443] [2025-02-07 21:25:46,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:46,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-07 21:25:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-07 21:25:46,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:46,733 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-07 21:25:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146216443] [2025-02-07 21:25:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146216443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801464911] [2025-02-07 21:25:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:46,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:46,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:46,754 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 88 states have internal predecessors, (115), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-07 21:25:50,782 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-07 21:25:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:50,835 INFO L93 Difference]: Finished difference Result 281 states and 448 transitions. [2025-02-07 21:25:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:50,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 142 [2025-02-07 21:25:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:50,842 INFO L225 Difference]: With dead ends: 281 [2025-02-07 21:25:50,843 INFO L226 Difference]: Without dead ends: 139 [2025-02-07 21:25:50,849 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-07 21:25:50,851 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 397 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.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:50,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 397 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-07 21:25:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-07 21:25:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2025-02-07 21:25:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 85 states have (on average 1.188235294117647) internal successors, (101), 85 states have internal predecessors, (101), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-07 21:25:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2025-02-07 21:25:50,903 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 142 [2025-02-07 21:25:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:50,903 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2025-02-07 21:25:50,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-07 21:25:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2025-02-07 21:25:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-07 21:25:50,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:50,906 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] [2025-02-07 21:25:50,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:50,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:50,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1353661078, now seen corresponding path program 1 times [2025-02-07 21:25:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845028364] [2025-02-07 21:25:50,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-07 21:25:51,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-07 21:25:51,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,198 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-07 21:25:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845028364] [2025-02-07 21:25:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845028364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630833936] [2025-02-07 21:25:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:51,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:51,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:51,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:51,200 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-07 21:25:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:51,238 INFO L93 Difference]: Finished difference Result 275 states and 382 transitions. [2025-02-07 21:25:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 144 [2025-02-07 21:25:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:51,241 INFO L225 Difference]: With dead ends: 275 [2025-02-07 21:25:51,242 INFO L226 Difference]: Without dead ends: 139 [2025-02-07 21:25:51,243 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-07 21:25:51,244 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 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-07 21:25:51,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-07 21:25:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-07 21:25:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-07 21:25:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 192 transitions. [2025-02-07 21:25:51,261 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 192 transitions. Word has length 144 [2025-02-07 21:25:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:51,262 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 192 transitions. [2025-02-07 21:25:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-07 21:25:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2025-02-07 21:25:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-07 21:25:51,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:51,265 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-07 21:25:51,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:51,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:51,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1524740640, now seen corresponding path program 1 times [2025-02-07 21:25:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828727252] [2025-02-07 21:25:51,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:51,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-07 21:25:51,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-07 21:25:51,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,600 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-07 21:25:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828727252] [2025-02-07 21:25:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828727252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730108283] [2025-02-07 21:25:51,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:51,606 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-07 21:25:51,610 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-07 21:25:51,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-07 21:25:52,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-07 21:25:52,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:52,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:52,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:52,065 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-07 21:25:52,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:52,188 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-07 21:25:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730108283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:52,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:52,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534847004] [2025-02-07 21:25:52,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:52,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:52,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:52,190 INFO L87 Difference]: Start difference. First operand 139 states and 192 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-07 21:25:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:52,229 INFO L93 Difference]: Finished difference Result 278 states and 386 transitions. [2025-02-07 21:25:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 145 [2025-02-07 21:25:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:52,232 INFO L225 Difference]: With dead ends: 278 [2025-02-07 21:25:52,232 INFO L226 Difference]: Without dead ends: 141 [2025-02-07 21:25:52,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 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-07 21:25:52,233 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:52,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-07 21:25:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-07 21:25:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.1818181818181819) internal successors, (104), 88 states have internal predecessors, (104), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-07 21:25:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2025-02-07 21:25:52,265 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 145 [2025-02-07 21:25:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:52,265 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2025-02-07 21:25:52,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-07 21:25:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2025-02-07 21:25:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-07 21:25:52,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:52,270 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] [2025-02-07 21:25:52,278 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-07 21:25:52,470 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-07 21:25:52,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 745993056, now seen corresponding path program 2 times [2025-02-07 21:25:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475526461] [2025-02-07 21:25:52,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:52,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-02-07 21:25:52,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 147 statements. [2025-02-07 21:25:52,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:52,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:52,804 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-07 21:25:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475526461] [2025-02-07 21:25:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475526461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:52,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266321132] [2025-02-07 21:25:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:52,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:52,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:52,806 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-07 21:25:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:52,861 INFO L93 Difference]: Finished difference Result 273 states and 382 transitions. [2025-02-07 21:25:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:52,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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 147 [2025-02-07 21:25:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:52,866 INFO L225 Difference]: With dead ends: 273 [2025-02-07 21:25:52,867 INFO L226 Difference]: Without dead ends: 223 [2025-02-07 21:25:52,868 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-07 21:25:52,869 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 131 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 650 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-07 21:25:52,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 650 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-07 21:25:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-07 21:25:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 141 states have internal predecessors, (168), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (73), 67 states have call predecessors, (73), 67 states have call successors, (73) [2025-02-07 21:25:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 308 transitions. [2025-02-07 21:25:52,897 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 308 transitions. Word has length 147 [2025-02-07 21:25:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:52,898 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 308 transitions. [2025-02-07 21:25:52,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-07 21:25:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 308 transitions. [2025-02-07 21:25:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-07 21:25:52,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:52,901 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:52,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:52,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:52,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash 43703858, now seen corresponding path program 1 times [2025-02-07 21:25:52,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:52,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27503681] [2025-02-07 21:25:52,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:53,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-07 21:25:53,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-07 21:25:53,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:53,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2025-02-07 21:25:53,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:53,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27503681] [2025-02-07 21:25:53,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27503681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:53,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20816542] [2025-02-07 21:25:53,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:53,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:53,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:53,380 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-07 21:25:53,381 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-07 21:25:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-07 21:25:53,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-07 21:25:53,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:53,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:53,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:53,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2025-02-07 21:25:53,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2025-02-07 21:25:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20816542] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:54,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-02-07 21:25:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398932559] [2025-02-07 21:25:54,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:54,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:54,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:54,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:54,283 INFO L87 Difference]: Start difference. First operand 223 states and 308 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-07 21:25:58,314 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-07 21:26:02,902 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-07 21:26:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:02,943 INFO L93 Difference]: Finished difference Result 449 states and 621 transitions. [2025-02-07 21:26:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:26:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 317 [2025-02-07 21:26:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:02,950 INFO L225 Difference]: With dead ends: 449 [2025-02-07 21:26:02,950 INFO L226 Difference]: Without dead ends: 233 [2025-02-07 21:26:02,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 631 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-07 21:26:02,951 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 2 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:02,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 742 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-02-07 21:26:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-07 21:26:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-02-07 21:26:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 151 states have (on average 1.1920529801324504) internal successors, (180), 151 states have internal predecessors, (180), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (73), 67 states have call predecessors, (73), 67 states have call successors, (73) [2025-02-07 21:26:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 320 transitions. [2025-02-07 21:26:02,971 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 320 transitions. Word has length 317 [2025-02-07 21:26:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:02,972 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 320 transitions. [2025-02-07 21:26:02,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-07 21:26:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 320 transitions. [2025-02-07 21:26:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-07 21:26:02,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:02,976 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-07 21:26:02,985 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-07 21:26:03,180 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-07 21:26:03,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 562937650, now seen corresponding path program 2 times [2025-02-07 21:26:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681726351] [2025-02-07 21:26:03,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:26:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:03,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 327 statements into 2 equivalence classes. [2025-02-07 21:26:03,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 327 statements. [2025-02-07 21:26:03,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:26:03,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2025-02-07 21:26:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:03,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681726351] [2025-02-07 21:26:03,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681726351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:03,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:26:03,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:26:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316105414] [2025-02-07 21:26:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:03,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:26:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:03,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:26:03,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:26:03,530 INFO L87 Difference]: Start difference. First operand 233 states and 320 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-07 21:26:07,554 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-07 21:26:11,562 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-07 21:26:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:11,657 INFO L93 Difference]: Finished difference Result 639 states and 882 transitions. [2025-02-07 21:26:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:26:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 327 [2025-02-07 21:26:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:11,662 INFO L225 Difference]: With dead ends: 639 [2025-02-07 21:26:11,663 INFO L226 Difference]: Without dead ends: 439 [2025-02-07 21:26:11,664 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-07 21:26:11,665 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 175 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:11,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 805 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-07 21:26:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-07 21:26:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2025-02-07 21:26:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 275 states have (on average 1.1781818181818182) internal successors, (324), 275 states have internal predecessors, (324), 131 states have call successors, (131), 28 states have call predecessors, (131), 28 states have return successors, (150), 131 states have call predecessors, (150), 131 states have call successors, (150) [2025-02-07 21:26:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 605 transitions. [2025-02-07 21:26:11,706 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 605 transitions. Word has length 327 [2025-02-07 21:26:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:11,707 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 605 transitions. [2025-02-07 21:26:11,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-07 21:26:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 605 transitions. [2025-02-07 21:26:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-07 21:26:11,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:11,712 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-07 21:26:11,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:26:11,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2103767726, now seen corresponding path program 1 times [2025-02-07 21:26:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860051372] [2025-02-07 21:26:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:11,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-07 21:26:11,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-07 21:26:11,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:11,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2025-02-07 21:26:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860051372] [2025-02-07 21:26:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860051372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:12,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:26:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:26:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973146704] [2025-02-07 21:26:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:12,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:26:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:12,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:26:12,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:26:12,529 INFO L87 Difference]: Start difference. First operand 435 states and 605 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-07 21:26:16,547 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-07 21:26:20,558 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-07 21:26:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:20,662 INFO L93 Difference]: Finished difference Result 802 states and 1103 transitions. [2025-02-07 21:26:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:26:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 327 [2025-02-07 21:26:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:20,666 INFO L225 Difference]: With dead ends: 802 [2025-02-07 21:26:20,666 INFO L226 Difference]: Without dead ends: 395 [2025-02-07 21:26:20,669 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-07 21:26:20,669 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 171 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:20,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 802 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-07 21:26:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-07 21:26:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2025-02-07 21:26:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 248 states have (on average 1.1733870967741935) internal successors, (291), 248 states have internal predecessors, (291), 117 states have call successors, (117), 25 states have call predecessors, (117), 25 states have return successors, (129), 117 states have call predecessors, (129), 117 states have call successors, (129) [2025-02-07 21:26:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 537 transitions. [2025-02-07 21:26:20,699 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 537 transitions. Word has length 327 [2025-02-07 21:26:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:20,700 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 537 transitions. [2025-02-07 21:26:20,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-07 21:26:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 537 transitions. [2025-02-07 21:26:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-07 21:26:20,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:20,704 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-07 21:26:20,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:26:20,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:20,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash -863476878, now seen corresponding path program 1 times [2025-02-07 21:26:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:20,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261297417] [2025-02-07 21:26:20,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:20,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-07 21:26:20,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-07 21:26:20,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:20,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2294 trivial. 0 not checked. [2025-02-07 21:26:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261297417] [2025-02-07 21:26:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261297417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626697690] [2025-02-07 21:26:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:21,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:21,350 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-07 21:26:21,351 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-07 21:26:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-07 21:26:21,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-07 21:26:21,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:21,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:21,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 2207 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 21:26:21,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-02-07 21:26:22,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:26:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626697690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:26:22,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 21:26:22,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383032536] [2025-02-07 21:26:22,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:22,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:26:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:22,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:26:22,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:26:22,218 INFO L87 Difference]: Start difference. First operand 391 states and 537 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 4 states have call successors, (44), 3 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2025-02-07 21:26:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:22,877 INFO L93 Difference]: Finished difference Result 893 states and 1212 transitions. [2025-02-07 21:26:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:26:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 4 states have call successors, (44), 3 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 327 [2025-02-07 21:26:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:22,881 INFO L225 Difference]: With dead ends: 893 [2025-02-07 21:26:22,881 INFO L226 Difference]: Without dead ends: 454 [2025-02-07 21:26:22,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:26:22,883 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 198 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:22,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 414 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:26:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-07 21:26:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2025-02-07 21:26:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 287 states have (on average 1.1428571428571428) internal successors, (328), 291 states have internal predecessors, (328), 128 states have call successors, (128), 33 states have call predecessors, (128), 35 states have return successors, (152), 126 states have call predecessors, (152), 128 states have call successors, (152) [2025-02-07 21:26:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 608 transitions. [2025-02-07 21:26:22,905 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 608 transitions. Word has length 327 [2025-02-07 21:26:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:22,906 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 608 transitions. [2025-02-07 21:26:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 4 states have call successors, (44), 3 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2025-02-07 21:26:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 608 transitions. [2025-02-07 21:26:22,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-07 21:26:22,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:22,909 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-07 21:26:22,919 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-07 21:26:23,109 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-07 21:26:23,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:23,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash 72523282, now seen corresponding path program 1 times [2025-02-07 21:26:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318874814] [2025-02-07 21:26:23,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:23,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-07 21:26:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-07 21:26:23,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:23,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2294 trivial. 0 not checked. [2025-02-07 21:26:23,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318874814] [2025-02-07 21:26:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318874814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682121524] [2025-02-07 21:26:23,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:23,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:23,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:23,697 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-07 21:26:23,701 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-07 21:26:24,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-07 21:26:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-07 21:26:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:24,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 2201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:26:24,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 880 proven. 4 refuted. 0 times theorem prover too weak. 1414 trivial. 0 not checked. [2025-02-07 21:26:24,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2294 trivial. 0 not checked. [2025-02-07 21:26:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682121524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:24,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-07 21:26:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298513802] [2025-02-07 21:26:24,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:26:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:24,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:26:24,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:26:24,992 INFO L87 Difference]: Start difference. First operand 451 states and 608 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 9 states have call successors, (84), 5 states have call predecessors, (84), 6 states have return successors, (85), 7 states have call predecessors, (85), 9 states have call successors, (85) [2025-02-07 21:26:29,029 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-07 21:26:33,037 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-07 21:26:37,043 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-07 21:26:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:37,715 INFO L93 Difference]: Finished difference Result 891 states and 1210 transitions. [2025-02-07 21:26:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:26:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 9 states have call successors, (84), 5 states have call predecessors, (84), 6 states have return successors, (85), 7 states have call predecessors, (85), 9 states have call successors, (85) Word has length 325 [2025-02-07 21:26:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:37,720 INFO L225 Difference]: With dead ends: 891 [2025-02-07 21:26:37,720 INFO L226 Difference]: Without dead ends: 484 [2025-02-07 21:26:37,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 649 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-07 21:26:37,723 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 192 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 178 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:37,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 480 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 608 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-02-07 21:26:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-02-07 21:26:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 475. [2025-02-07 21:26:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 307 states have (on average 1.1433224755700326) internal successors, (351), 310 states have internal predecessors, (351), 123 states have call successors, (123), 42 states have call predecessors, (123), 44 states have return successors, (158), 122 states have call predecessors, (158), 123 states have call successors, (158) [2025-02-07 21:26:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 632 transitions. [2025-02-07 21:26:37,800 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 632 transitions. Word has length 325 [2025-02-07 21:26:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:37,800 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 632 transitions. [2025-02-07 21:26:37,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 9 states have call successors, (84), 5 states have call predecessors, (84), 6 states have return successors, (85), 7 states have call predecessors, (85), 9 states have call successors, (85) [2025-02-07 21:26:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 632 transitions. [2025-02-07 21:26:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-07 21:26:37,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:37,806 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-07 21:26:37,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 21:26:38,007 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-07 21:26:38,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1990623698, now seen corresponding path program 1 times [2025-02-07 21:26:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044001852] [2025-02-07 21:26:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:38,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-07 21:26:38,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-07 21:26:38,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:38,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2291 trivial. 0 not checked. [2025-02-07 21:26:39,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:39,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044001852] [2025-02-07 21:26:39,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044001852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:39,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:26:39,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-07 21:26:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353124705] [2025-02-07 21:26:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:26:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:39,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:26:39,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:26:39,378 INFO L87 Difference]: Start difference. First operand 475 states and 632 transitions. Second operand has 13 states, 12 states have (on average 7.0) internal successors, (84), 13 states have internal predecessors, (84), 8 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) [2025-02-07 21:26:43,455 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-07 21:26:47,463 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-07 21:26:51,479 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-07 21:26:55,494 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-07 21:26:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:57,784 INFO L93 Difference]: Finished difference Result 822 states and 1140 transitions. [2025-02-07 21:26:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:26:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.0) internal successors, (84), 13 states have internal predecessors, (84), 8 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) Word has length 325 [2025-02-07 21:26:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:57,788 INFO L225 Difference]: With dead ends: 822 [2025-02-07 21:26:57,788 INFO L226 Difference]: Without dead ends: 554 [2025-02-07 21:26:57,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:26:57,794 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 186 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 164 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:57,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1111 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1351 Invalid, 4 Unknown, 0 Unchecked, 18.3s Time] [2025-02-07 21:26:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-07 21:26:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 525. [2025-02-07 21:26:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 332 states have (on average 1.1325301204819278) internal successors, (376), 336 states have internal predecessors, (376), 147 states have call successors, (147), 42 states have call predecessors, (147), 45 states have return successors, (203), 146 states have call predecessors, (203), 147 states have call successors, (203) [2025-02-07 21:26:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 726 transitions. [2025-02-07 21:26:57,820 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 726 transitions. Word has length 325 [2025-02-07 21:26:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:57,820 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 726 transitions. [2025-02-07 21:26:57,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.0) internal successors, (84), 13 states have internal predecessors, (84), 8 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) [2025-02-07 21:26:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 726 transitions. [2025-02-07 21:26:57,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-07 21:26:57,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:57,824 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 10, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:26:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:26:57,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash -97922294, now seen corresponding path program 1 times [2025-02-07 21:26:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558275196] [2025-02-07 21:26:57,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-07 21:26:58,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-07 21:26:58,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:58,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2291 trivial. 0 not checked. [2025-02-07 21:26:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558275196] [2025-02-07 21:26:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558275196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643020147] [2025-02-07 21:26:59,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:59,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:59,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:59,657 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-07 21:26:59,659 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-07 21:27:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-07 21:27:00,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-07 21:27:00,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:27:00,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:27:00,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 2308 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 21:27:00,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:27:00,608 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 [2025-02-07 21:27:07,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:27:07,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:27:07,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-02-07 21:27:08,130 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-07 21:27:08,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 25 treesize of output 24