./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_fib-1.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 da5783328d73eba8f05689c8b63c9b7f7c1c1eeab4600bb7173d3ddf64fb59e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:51:32,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:51:33,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:51:33,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:51:33,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:51:33,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:51:33,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:51:33,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:51:33,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:51:33,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:51:33,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:51:33,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:51:33,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:51:33,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:51:33,077 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:51:33,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:51:33,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:33,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:51:33,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:51:33,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:51:33,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:51:33,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:51:33,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:51:33,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:51:33,079 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 -> da5783328d73eba8f05689c8b63c9b7f7c1c1eeab4600bb7173d3ddf64fb59e0 [2025-02-05 16:51:33,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:51:33,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:51:33,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:51:33,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:51:33,341 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:51:33,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-1.i [2025-02-05 16:51:34,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee8a40975/aa1f0be05fc74a24a8b341f39d83e5da/FLAGf5bb25dbb [2025-02-05 16:51:34,901 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:51:34,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-1.i [2025-02-05 16:51:34,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee8a40975/aa1f0be05fc74a24a8b341f39d83e5da/FLAGf5bb25dbb [2025-02-05 16:51:34,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee8a40975/aa1f0be05fc74a24a8b341f39d83e5da [2025-02-05 16:51:34,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:51:34,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:51:34,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:51:34,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:51:34,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:51:34,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:51:34" (1/1) ... [2025-02-05 16:51:34,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:34, skipping insertion in model container [2025-02-05 16:51:34,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:51:34" (1/1) ... [2025-02-05 16:51:34,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:51:35,165 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_fib-1.i[23602,23615] [2025-02-05 16:51:35,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:51:35,257 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:51:35,290 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_fib-1.i[23602,23615] [2025-02-05 16:51:35,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:51:35,379 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:51:35,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35 WrapperNode [2025-02-05 16:51:35,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:51:35,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:51:35,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:51:35,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:51:35,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,429 INFO L138 Inliner]: procedures = 145, calls = 397, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 704 [2025-02-05 16:51:35,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:51:35,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:51:35,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:51:35,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:51:35,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,469 INFO L175 MemorySlicer]: Split 269 memory accesses to 15 slices as follows [2, 8, 8, 8, 53, 31, 48, 22, 22, 11, 10, 4, 31, 0, 11]. 20 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 3, 3, 3, 18, 0, 18, 6, 6, 0, 6, 2, 0, 0, 0]. The 63 writes are split as follows [0, 2, 2, 2, 20, 1, 15, 7, 7, 1, 2, 2, 1, 0, 1]. [2025-02-05 16:51:35,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:51:35,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:51:35,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:51:35,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:51:35,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (1/1) ... [2025-02-05 16:51:35,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:35,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:35,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:51:35,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:51:35,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:51:35,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:51:35,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:51:35,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:51:35,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:51:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:51:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:51:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:51:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:51:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:51:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:51:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:51:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:51:35,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:51:35,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:51:35,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:51:35,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:51:35,566 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:51:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:51:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:51:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:51:35,781 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:51:35,783 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:51:36,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:51:36,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:51:40,561 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 16:51:40,561 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:51:40,577 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:51:40,577 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:51:40,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:51:40 BoogieIcfgContainer [2025-02-05 16:51:40,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:51:40,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:51:40,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:51:40,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:51:40,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:51:34" (1/3) ... [2025-02-05 16:51:40,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5013aaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:51:40, skipping insertion in model container [2025-02-05 16:51:40,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:35" (2/3) ... [2025-02-05 16:51:40,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5013aaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:51:40, skipping insertion in model container [2025-02-05 16:51:40,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:51:40" (3/3) ... [2025-02-05 16:51:40,589 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-1.i [2025-02-05 16:51:40,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:51:40,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib-1.i that has 5 procedures, 167 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 16:51:40,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:51:40,672 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;@3d283b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:51:40,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:51:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 103 states have internal predecessors, (135), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 16:51:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 16:51:40,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:40,703 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:40,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:40,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 234945594, now seen corresponding path program 1 times [2025-02-05 16:51:40,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:40,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779715992] [2025-02-05 16:51:40,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:40,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 16:51:41,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 16:51:41,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:41,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-05 16:51:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779715992] [2025-02-05 16:51:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779715992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696575566] [2025-02-05 16:51:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:41,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:41,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:41,516 INFO L87 Difference]: Start difference. First operand has 167 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 103 states have internal predecessors, (135), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:45,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:51:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:45,613 INFO L93 Difference]: Finished difference Result 332 states and 561 transitions. [2025-02-05 16:51:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2025-02-05 16:51:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:45,620 INFO L225 Difference]: With dead ends: 332 [2025-02-05 16:51:45,621 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 16:51:45,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:45,625 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:45,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 16:51:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 16:51:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2025-02-05 16:51:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 16:51:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 248 transitions. [2025-02-05 16:51:45,671 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 248 transitions. Word has length 251 [2025-02-05 16:51:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:45,673 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 248 transitions. [2025-02-05 16:51:45,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 248 transitions. [2025-02-05 16:51:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 16:51:45,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:45,681 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:45,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:51:45,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:45,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 750818004, now seen corresponding path program 1 times [2025-02-05 16:51:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729766566] [2025-02-05 16:51:45,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 16:51:45,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 16:51:45,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:45,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-05 16:51:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729766566] [2025-02-05 16:51:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729766566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290219306] [2025-02-05 16:51:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:46,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:46,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:46,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:46,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:46,183 INFO L87 Difference]: Start difference. First operand 164 states and 248 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:46,214 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2025-02-05 16:51:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 253 [2025-02-05 16:51:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:46,217 INFO L225 Difference]: With dead ends: 326 [2025-02-05 16:51:46,217 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 16:51:46,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:46,219 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:46,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 16:51:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-05 16:51:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 16:51:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2025-02-05 16:51:46,235 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 253 [2025-02-05 16:51:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:46,235 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2025-02-05 16:51:46,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2025-02-05 16:51:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 16:51:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:46,239 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:46,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:51:46,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2007092779, now seen corresponding path program 1 times [2025-02-05 16:51:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385453611] [2025-02-05 16:51:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 16:51:46,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 16:51:46,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:46,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-05 16:51:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385453611] [2025-02-05 16:51:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385453611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:51:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021627567] [2025-02-05 16:51:46,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:46,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:51:46,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:51:47,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 16:51:47,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 16:51:47,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:47,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:47,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:51:47,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:51:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-05 16:51:47,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:51:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-05 16:51:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021627567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:51:47,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:51:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:51:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678419724] [2025-02-05 16:51:47,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:51:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:51:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:47,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:51:47,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:51:47,500 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 16:51:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:47,532 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2025-02-05 16:51:47,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:51:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 254 [2025-02-05 16:51:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:47,534 INFO L225 Difference]: With dead ends: 329 [2025-02-05 16:51:47,534 INFO L226 Difference]: Without dead ends: 167 [2025-02-05 16:51:47,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 505 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:51:47,535 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:47,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 732 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-05 16:51:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-02-05 16:51:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 103 states have internal predecessors, (133), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 16:51:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2025-02-05 16:51:47,546 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 254 [2025-02-05 16:51:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:47,546 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2025-02-05 16:51:47,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 16:51:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2025-02-05 16:51:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 16:51:47,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:47,549 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:47,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:51:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:47,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1603813557, now seen corresponding path program 2 times [2025-02-05 16:51:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284070428] [2025-02-05 16:51:47,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:51:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:47,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 256 statements into 2 equivalence classes. [2025-02-05 16:51:47,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 256 statements. [2025-02-05 16:51:47,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:51:47,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2025-02-05 16:51:48,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284070428] [2025-02-05 16:51:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284070428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747730995] [2025-02-05 16:51:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:51:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:48,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:51:48,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:51:48,158 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:48,203 INFO L93 Difference]: Finished difference Result 324 states and 491 transitions. [2025-02-05 16:51:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:51:48,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2025-02-05 16:51:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:48,210 INFO L225 Difference]: With dead ends: 324 [2025-02-05 16:51:48,210 INFO L226 Difference]: Without dead ends: 238 [2025-02-05 16:51:48,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:51:48,212 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 153 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:48,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 727 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-05 16:51:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2025-02-05 16:51:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 77 states have call successors, (77), 8 states have call predecessors, (77), 8 states have return successors, (79), 77 states have call predecessors, (79), 77 states have call successors, (79) [2025-02-05 16:51:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 362 transitions. [2025-02-05 16:51:48,240 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 362 transitions. Word has length 256 [2025-02-05 16:51:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:48,241 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 362 transitions. [2025-02-05 16:51:48,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 362 transitions. [2025-02-05 16:51:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-05 16:51:48,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:48,247 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:48,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:51:48,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash 808744803, now seen corresponding path program 1 times [2025-02-05 16:51:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462137430] [2025-02-05 16:51:48,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:48,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-05 16:51:48,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-05 16:51:48,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:48,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-02-05 16:51:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462137430] [2025-02-05 16:51:48,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462137430] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:51:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982056863] [2025-02-05 16:51:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:48,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:48,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:51:48,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:51:49,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-05 16:51:49,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-05 16:51:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:49,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 1927 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:51:49,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:51:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-02-05 16:51:49,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:51:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-02-05 16:51:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982056863] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:51:49,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:51:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 16:51:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109702402] [2025-02-05 16:51:49,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:51:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:51:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:49,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:51:49,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:51:49,729 INFO L87 Difference]: Start difference. First operand 237 states and 362 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-05 16:51:53,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:51:57,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:01,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:05,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:09,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:09,862 INFO L93 Difference]: Finished difference Result 481 states and 735 transitions. [2025-02-05 16:52:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:09,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 324 [2025-02-05 16:52:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:09,865 INFO L225 Difference]: With dead ends: 481 [2025-02-05 16:52:09,865 INFO L226 Difference]: Without dead ends: 252 [2025-02-05 16:52:09,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:09,866 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:09,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 728 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-05 16:52:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-05 16:52:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-05 16:52:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 77 states have call successors, (77), 8 states have call predecessors, (77), 8 states have return successors, (79), 77 states have call predecessors, (79), 77 states have call successors, (79) [2025-02-05 16:52:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2025-02-05 16:52:09,882 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 324 [2025-02-05 16:52:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:09,882 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2025-02-05 16:52:09,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-05 16:52:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2025-02-05 16:52:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 16:52:09,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:09,885 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:09,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:10,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -218791446, now seen corresponding path program 2 times [2025-02-05 16:52:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572479574] [2025-02-05 16:52:10,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:10,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 339 statements into 2 equivalence classes. [2025-02-05 16:52:10,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 339 statements. [2025-02-05 16:52:10,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:10,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3948 trivial. 0 not checked. [2025-02-05 16:52:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572479574] [2025-02-05 16:52:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572479574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:10,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435713618] [2025-02-05 16:52:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:10,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:10,523 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 16:52:14,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:18,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:18,674 INFO L93 Difference]: Finished difference Result 684 states and 1048 transitions. [2025-02-05 16:52:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 339 [2025-02-05 16:52:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:18,679 INFO L225 Difference]: With dead ends: 684 [2025-02-05 16:52:18,680 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 16:52:18,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:18,683 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 231 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1008 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-05 16:52:18,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1008 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-05 16:52:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 16:52:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 467. [2025-02-05 16:52:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 299 states have (on average 1.354515050167224) internal successors, (405), 299 states have internal predecessors, (405), 151 states have call successors, (151), 16 states have call predecessors, (151), 16 states have return successors, (162), 151 states have call predecessors, (162), 151 states have call successors, (162) [2025-02-05 16:52:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 718 transitions. [2025-02-05 16:52:18,723 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 718 transitions. Word has length 339 [2025-02-05 16:52:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:18,723 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 718 transitions. [2025-02-05 16:52:18,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 16:52:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 718 transitions. [2025-02-05 16:52:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 16:52:18,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:18,728 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:18,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:52:18,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:18,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1047552182, now seen corresponding path program 1 times [2025-02-05 16:52:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:18,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399500230] [2025-02-05 16:52:18,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:18,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 16:52:18,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 16:52:18,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3948 trivial. 0 not checked. [2025-02-05 16:52:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399500230] [2025-02-05 16:52:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399500230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071240558] [2025-02-05 16:52:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:19,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:19,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:19,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:19,667 INFO L87 Difference]: Start difference. First operand 467 states and 718 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (48), 1 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-02-05 16:52:23,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:27,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:31,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:31,850 INFO L93 Difference]: Finished difference Result 788 states and 1192 transitions. [2025-02-05 16:52:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:31,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (48), 1 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) Word has length 339 [2025-02-05 16:52:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:31,853 INFO L225 Difference]: With dead ends: 788 [2025-02-05 16:52:31,853 INFO L226 Difference]: Without dead ends: 424 [2025-02-05 16:52:31,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:31,855 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 233 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:31,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1354 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-02-05 16:52:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-05 16:52:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 420. [2025-02-05 16:52:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 268 states have (on average 1.2798507462686568) internal successors, (343), 270 states have internal predecessors, (343), 134 states have call successors, (134), 15 states have call predecessors, (134), 17 states have return successors, (142), 134 states have call predecessors, (142), 134 states have call successors, (142) [2025-02-05 16:52:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 619 transitions. [2025-02-05 16:52:31,892 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 619 transitions. Word has length 339 [2025-02-05 16:52:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:31,892 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 619 transitions. [2025-02-05 16:52:31,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (48), 1 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-02-05 16:52:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 619 transitions. [2025-02-05 16:52:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 16:52:31,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:31,896 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:31,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:52:31,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 908928905, now seen corresponding path program 1 times [2025-02-05 16:52:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524061624] [2025-02-05 16:52:31,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:32,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 16:52:32,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 16:52:32,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:32,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-02-05 16:52:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524061624] [2025-02-05 16:52:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524061624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441329851] [2025-02-05 16:52:32,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:32,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:32,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:52:32,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 16:52:33,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 16:52:33,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:33,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:33,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 2261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:52:33,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-02-05 16:52:33,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-02-05 16:52:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441329851] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:33,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:33,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-02-05 16:52:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847385756] [2025-02-05 16:52:33,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:33,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:52:33,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:33,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:52:33,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:52:33,662 INFO L87 Difference]: Start difference. First operand 420 states and 619 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-05 16:52:37,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:41,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:45,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:49,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:53,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:57,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:01,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:01,890 INFO L93 Difference]: Finished difference Result 827 states and 1224 transitions. [2025-02-05 16:53:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:53:01,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 339 [2025-02-05 16:53:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:01,896 INFO L225 Difference]: With dead ends: 827 [2025-02-05 16:53:01,897 INFO L226 Difference]: Without dead ends: 430 [2025-02-05 16:53:01,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 672 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:53:01,899 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 2 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:01,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 484 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-02-05 16:53:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-05 16:53:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-02-05 16:53:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.276978417266187) internal successors, (355), 280 states have internal predecessors, (355), 134 states have call successors, (134), 15 states have call predecessors, (134), 17 states have return successors, (142), 134 states have call predecessors, (142), 134 states have call successors, (142) [2025-02-05 16:53:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 631 transitions. [2025-02-05 16:53:01,951 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 631 transitions. Word has length 339 [2025-02-05 16:53:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:01,951 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 631 transitions. [2025-02-05 16:53:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-05 16:53:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 631 transitions. [2025-02-05 16:53:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 16:53:01,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:01,958 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 18, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:01,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:02,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:02,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:02,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash 163980073, now seen corresponding path program 2 times [2025-02-05 16:53:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:02,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285825540] [2025-02-05 16:53:02,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:53:02,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:02,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-02-05 16:53:02,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 16:53:02,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:53:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4111 trivial. 0 not checked. [2025-02-05 16:53:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285825540] [2025-02-05 16:53:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285825540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303249923] [2025-02-05 16:53:03,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:53:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:03,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:03,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:03,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:53:03,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes.