./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.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 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:47:42,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:47:42,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:47:42,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:47:42,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:47:42,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:47:42,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:47:42,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:47:42,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:47:42,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:47:42,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:47:42,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:47:42,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:47:42,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:47:42,133 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:47:42,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:47:42,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:47:42,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:47:42,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:47:42,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:47:42,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:47:42,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:47:42,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:47:42,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:47:42,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:47:42,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:47:42,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:47:42,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:47:42,136 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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2025-02-08 04:47:42,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:47:42,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:47:42,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:47:42,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:47:42,406 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:47:42,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2025-02-08 04:47:43,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b751ee500/a4145f899dca482d86f14f1086671e15/FLAG656d6cdea [2025-02-08 04:47:44,031 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:47:44,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2025-02-08 04:47:44,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b751ee500/a4145f899dca482d86f14f1086671e15/FLAG656d6cdea [2025-02-08 04:47:44,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b751ee500/a4145f899dca482d86f14f1086671e15 [2025-02-08 04:47:44,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:47:44,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:47:44,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:47:44,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:47:44,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:47:44,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:44,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761d1f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44, skipping insertion in model container [2025-02-08 04:47:44,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:44,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:47:44,540 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/uthash-2.0.2/uthash_BER_test5-3.i[33021,33034] [2025-02-08 04:47:44,692 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/uthash-2.0.2/uthash_BER_test5-3.i[49681,49694] [2025-02-08 04:47:44,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:47:44,739 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:47:44,770 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/uthash-2.0.2/uthash_BER_test5-3.i[33021,33034] [2025-02-08 04:47:44,860 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/uthash-2.0.2/uthash_BER_test5-3.i[49681,49694] [2025-02-08 04:47:44,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:47:44,898 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:47:44,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44 WrapperNode [2025-02-08 04:47:44,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:47:44,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:47:44,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:47:44,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:47:44,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:44,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,034 INFO L138 Inliner]: procedures = 177, calls = 472, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2278 [2025-02-08 04:47:45,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:47:45,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:47:45,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:47:45,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:47:45,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,224 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2025-02-08 04:47:45,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:47:45,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:47:45,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:47:45,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:47:45,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (1/1) ... [2025-02-08 04:47:45,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:47:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:47:45,397 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-08 04:47:45,403 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-08 04:47:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:47:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:47:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:47:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:47:45,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:47:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:47:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:47:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:47:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:47:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:47:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:47:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:47:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:47:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:47:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:47:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:47:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:47:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:47:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:47:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:47:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:47:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:47:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:47:45,693 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:47:45,695 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:47:47,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-02-08 04:47:47,822 INFO L? ?]: Removed 523 outVars from TransFormulas that were not future-live. [2025-02-08 04:47:47,822 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:47:47,907 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:47:47,911 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 04:47:47,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:47:47 BoogieIcfgContainer [2025-02-08 04:47:47,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:47:47,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:47:47,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:47:47,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:47:47,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:47:44" (1/3) ... [2025-02-08 04:47:47,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5f933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:47:47, skipping insertion in model container [2025-02-08 04:47:47,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:47:44" (2/3) ... [2025-02-08 04:47:47,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5f933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:47:47, skipping insertion in model container [2025-02-08 04:47:47,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:47:47" (3/3) ... [2025-02-08 04:47:47,922 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-3.i [2025-02-08 04:47:47,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:47:47,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-3.i that has 5 procedures, 628 locations, 1 initial locations, 58 loop locations, and 2 error locations. [2025-02-08 04:47:48,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:47:48,031 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;@419f9704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:47:48,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 04:47:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 620 states, 603 states have (on average 1.6235489220563848) internal successors, (979), 610 states have internal predecessors, (979), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:47:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 04:47:48,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:48,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 04:47:48,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2026558317, now seen corresponding path program 1 times [2025-02-08 04:47:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776637591] [2025-02-08 04:47:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:48,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:48,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 04:47:48,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 04:47:48,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:48,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:47:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776637591] [2025-02-08 04:47:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776637591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:48,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:48,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:47:48,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741268247] [2025-02-08 04:47:48,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:47:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:48,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:47:48,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:47:48,306 INFO L87 Difference]: Start difference. First operand has 620 states, 603 states have (on average 1.6235489220563848) internal successors, (979), 610 states have internal predecessors, (979), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:47:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:48,700 INFO L93 Difference]: Finished difference Result 1785 states and 2900 transitions. [2025-02-08 04:47:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:47:48,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 04:47:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:48,724 INFO L225 Difference]: With dead ends: 1785 [2025-02-08 04:47:48,725 INFO L226 Difference]: Without dead ends: 1099 [2025-02-08 04:47:48,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 04:47:48,733 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 780 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:48,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1704 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:47:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-08 04:47:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 555. [2025-02-08 04:47:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 541 states have (on average 1.4639556377079483) internal successors, (792), 546 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:47:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 809 transitions. [2025-02-08 04:47:48,829 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 809 transitions. Word has length 6 [2025-02-08 04:47:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:48,832 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 809 transitions. [2025-02-08 04:47:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:47:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 809 transitions. [2025-02-08 04:47:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 04:47:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:48,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:48,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:47:48,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:48,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1771820029, now seen corresponding path program 1 times [2025-02-08 04:47:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177508880] [2025-02-08 04:47:48,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:48,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 04:47:48,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 04:47:48,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:48,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:47:49,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:49,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177508880] [2025-02-08 04:47:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177508880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:49,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:47:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000032592] [2025-02-08 04:47:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:49,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:47:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:49,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:47:49,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:47:49,758 INFO L87 Difference]: Start difference. First operand 555 states and 809 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:47:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:50,030 INFO L93 Difference]: Finished difference Result 1111 states and 1619 transitions. [2025-02-08 04:47:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:47:50,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 04:47:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:50,036 INFO L225 Difference]: With dead ends: 1111 [2025-02-08 04:47:50,037 INFO L226 Difference]: Without dead ends: 558 [2025-02-08 04:47:50,039 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-08 04:47:50,039 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 105 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:50,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2070 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:47:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-08 04:47:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 555. [2025-02-08 04:47:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 541 states have (on average 1.4510166358595193) internal successors, (785), 546 states have internal predecessors, (785), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:47:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 802 transitions. [2025-02-08 04:47:50,074 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 802 transitions. Word has length 203 [2025-02-08 04:47:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:50,075 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 802 transitions. [2025-02-08 04:47:50,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:47:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 802 transitions. [2025-02-08 04:47:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 04:47:50,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:50,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:50,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:47:50,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1610023030, now seen corresponding path program 1 times [2025-02-08 04:47:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791719328] [2025-02-08 04:47:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:50,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 04:47:50,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 04:47:50,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:50,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:47:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791719328] [2025-02-08 04:47:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791719328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:50,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:50,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:47:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739762009] [2025-02-08 04:47:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:50,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:47:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:50,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:47:50,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:47:50,468 INFO L87 Difference]: Start difference. First operand 555 states and 802 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:47:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:50,666 INFO L93 Difference]: Finished difference Result 1236 states and 1790 transitions. [2025-02-08 04:47:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:47:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 04:47:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:50,673 INFO L225 Difference]: With dead ends: 1236 [2025-02-08 04:47:50,674 INFO L226 Difference]: Without dead ends: 683 [2025-02-08 04:47:50,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 04:47:50,675 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 134 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:50,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1467 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:47:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-08 04:47:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-02-08 04:47:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 669 states have (on average 1.452914798206278) internal successors, (972), 674 states have internal predecessors, (972), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:47:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 989 transitions. [2025-02-08 04:47:50,699 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 989 transitions. Word has length 203 [2025-02-08 04:47:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:50,700 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 989 transitions. [2025-02-08 04:47:50,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:47:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 989 transitions. [2025-02-08 04:47:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-08 04:47:50,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:50,704 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:50,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:47:50,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:50,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -632464997, now seen corresponding path program 1 times [2025-02-08 04:47:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034322143] [2025-02-08 04:47:50,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:50,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 04:47:50,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 04:47:50,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:47:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034322143] [2025-02-08 04:47:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034322143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:47:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059616050] [2025-02-08 04:47:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:47:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:47:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:47:51,224 INFO L87 Difference]: Start difference. First operand 683 states and 989 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:47:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:51,418 INFO L93 Difference]: Finished difference Result 1194 states and 1723 transitions. [2025-02-08 04:47:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:47:51,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 218 [2025-02-08 04:47:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:51,423 INFO L225 Difference]: With dead ends: 1194 [2025-02-08 04:47:51,423 INFO L226 Difference]: Without dead ends: 641 [2025-02-08 04:47:51,424 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-08 04:47:51,425 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 30 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:51,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1917 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:47:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-02-08 04:47:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-02-08 04:47:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 627 states have (on average 1.427432216905901) internal successors, (895), 632 states have internal predecessors, (895), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:47:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 912 transitions. [2025-02-08 04:47:51,444 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 912 transitions. Word has length 218 [2025-02-08 04:47:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 912 transitions. [2025-02-08 04:47:51,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:47:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 912 transitions. [2025-02-08 04:47:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-08 04:47:51,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:51,447 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:47:51,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2073134749, now seen corresponding path program 1 times [2025-02-08 04:47:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762620921] [2025-02-08 04:47:51,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:51,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 04:47:51,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 04:47:51,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:51,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:47:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762620921] [2025-02-08 04:47:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762620921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:51,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:47:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665654752] [2025-02-08 04:47:51,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:51,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:47:51,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:51,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:47:51,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:47:51,854 INFO L87 Difference]: Start difference. First operand 641 states and 912 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:47:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:52,011 INFO L93 Difference]: Finished difference Result 1152 states and 1635 transitions. [2025-02-08 04:47:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:47:52,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 218 [2025-02-08 04:47:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:52,017 INFO L225 Difference]: With dead ends: 1152 [2025-02-08 04:47:52,017 INFO L226 Difference]: Without dead ends: 641 [2025-02-08 04:47:52,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 04:47:52,021 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:52,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1294 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:47:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-02-08 04:47:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-02-08 04:47:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 627 states have (on average 1.4226475279106858) internal successors, (892), 632 states have internal predecessors, (892), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:47:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 909 transitions. [2025-02-08 04:47:52,052 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 909 transitions. Word has length 218 [2025-02-08 04:47:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:52,054 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 909 transitions. [2025-02-08 04:47:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:47:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 909 transitions. [2025-02-08 04:47:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-08 04:47:52,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:52,063 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:52,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:47:52,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:52,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1086058401, now seen corresponding path program 1 times [2025-02-08 04:47:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483908980] [2025-02-08 04:47:52,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:52,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 04:47:52,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 04:47:52,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:52,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:47:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483908980] [2025-02-08 04:47:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483908980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:47:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792766223] [2025-02-08 04:47:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:52,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:47:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:52,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:47:52,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:47:52,436 INFO L87 Difference]: Start difference. First operand 641 states and 909 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:47:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:52,669 INFO L93 Difference]: Finished difference Result 1440 states and 2038 transitions. [2025-02-08 04:47:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:47:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 218 [2025-02-08 04:47:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:52,675 INFO L225 Difference]: With dead ends: 1440 [2025-02-08 04:47:52,676 INFO L226 Difference]: Without dead ends: 929 [2025-02-08 04:47:52,677 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-08 04:47:52,678 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 451 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:52,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1487 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:47:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-08 04:47:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 922. [2025-02-08 04:47:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 905 states have (on average 1.4220994475138122) internal successors, (1287), 910 states have internal predecessors, (1287), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:47:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1310 transitions. [2025-02-08 04:47:52,709 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1310 transitions. Word has length 218 [2025-02-08 04:47:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:52,709 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1310 transitions. [2025-02-08 04:47:52,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:47:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1310 transitions. [2025-02-08 04:47:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-08 04:47:52,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:52,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:52,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:47:52,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash -558725396, now seen corresponding path program 1 times [2025-02-08 04:47:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314579768] [2025-02-08 04:47:52,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:52,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-08 04:47:52,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-08 04:47:52,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:52,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314579768] [2025-02-08 04:47:53,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314579768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:47:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397844701] [2025-02-08 04:47:53,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:53,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:53,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:47:53,157 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-08 04:47:53,159 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-08 04:47:53,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-08 04:47:53,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-08 04:47:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:53,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 04:47:53,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:47:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 04:47:53,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:47:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397844701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:47:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-08 04:47:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696926772] [2025-02-08 04:47:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:53,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:47:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:53,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:47:53,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:47:53,776 INFO L87 Difference]: Start difference. First operand 922 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:47:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:53,979 INFO L93 Difference]: Finished difference Result 1268 states and 1827 transitions. [2025-02-08 04:47:53,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:47:53,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2025-02-08 04:47:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:53,984 INFO L225 Difference]: With dead ends: 1268 [2025-02-08 04:47:53,984 INFO L226 Difference]: Without dead ends: 962 [2025-02-08 04:47:53,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:47:53,986 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 8 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:53,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1273 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:47:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-02-08 04:47:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-02-08 04:47:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 945 states have (on average 1.4042328042328043) internal successors, (1327), 950 states have internal predecessors, (1327), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:47:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1350 transitions. [2025-02-08 04:47:54,019 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1350 transitions. Word has length 233 [2025-02-08 04:47:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:54,019 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1350 transitions. [2025-02-08 04:47:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:47:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1350 transitions. [2025-02-08 04:47:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-08 04:47:54,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:54,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:54,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 04:47:54,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:54,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:54,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2020305395, now seen corresponding path program 1 times [2025-02-08 04:47:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:54,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246705480] [2025-02-08 04:47:54,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:54,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-08 04:47:54,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-08 04:47:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:54,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:54,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246705480] [2025-02-08 04:47:54,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246705480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:47:54,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009275395] [2025-02-08 04:47:54,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:54,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:54,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:47:54,627 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-08 04:47:54,630 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-08 04:47:55,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-08 04:47:55,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-08 04:47:55,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:55,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:55,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 04:47:55,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:47:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 04:47:55,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:47:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009275395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:47:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 04:47:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314879778] [2025-02-08 04:47:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:55,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:47:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:55,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:47:55,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:47:55,308 INFO L87 Difference]: Start difference. First operand 962 states and 1350 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:47:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:55,527 INFO L93 Difference]: Finished difference Result 1280 states and 1819 transitions. [2025-02-08 04:47:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:47:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2025-02-08 04:47:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:55,535 INFO L225 Difference]: With dead ends: 1280 [2025-02-08 04:47:55,536 INFO L226 Difference]: Without dead ends: 934 [2025-02-08 04:47:55,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:47:55,538 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 105 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:55,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1827 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:47:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-08 04:47:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2025-02-08 04:47:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 917 states have (on average 1.401308615049073) internal successors, (1285), 922 states have internal predecessors, (1285), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:47:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1308 transitions. [2025-02-08 04:47:55,575 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1308 transitions. Word has length 233 [2025-02-08 04:47:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:55,576 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1308 transitions. [2025-02-08 04:47:55,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:47:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1308 transitions. [2025-02-08 04:47:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-08 04:47:55,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:55,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:47:55,592 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-08 04:47:55,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:55,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:55,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1144482458, now seen corresponding path program 1 times [2025-02-08 04:47:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116792516] [2025-02-08 04:47:55,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:55,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-08 04:47:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-08 04:47:55,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:56,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116792516] [2025-02-08 04:47:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116792516] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:47:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623107999] [2025-02-08 04:47:56,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:56,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:47:56,161 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-08 04:47:56,164 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-08 04:47:56,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-08 04:47:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-08 04:47:56,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:56,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:56,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 04:47:56,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:47:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:56,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:47:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623107999] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:47:57,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:47:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 04:47:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818985681] [2025-02-08 04:47:57,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:47:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:47:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:47:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:47:57,269 INFO L87 Difference]: Start difference. First operand 934 states and 1308 transitions. Second operand has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 04:47:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:57,724 INFO L93 Difference]: Finished difference Result 2485 states and 3494 transitions. [2025-02-08 04:47:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:47:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2025-02-08 04:47:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:57,736 INFO L225 Difference]: With dead ends: 2485 [2025-02-08 04:47:57,737 INFO L226 Difference]: Without dead ends: 2167 [2025-02-08 04:47:57,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 463 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-08 04:47:57,740 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 2444 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:57,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 3334 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:47:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2025-02-08 04:47:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1672. [2025-02-08 04:47:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1640 states have (on average 1.3847560975609756) internal successors, (2271), 1645 states have internal predecessors, (2271), 29 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 04:47:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2324 transitions. [2025-02-08 04:47:57,804 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2324 transitions. Word has length 233 [2025-02-08 04:47:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:57,805 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2324 transitions. [2025-02-08 04:47:57,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 04:47:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2324 transitions. [2025-02-08 04:47:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-02-08 04:47:57,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:57,818 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-02-08 04:47:57,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 04:47:58,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:58,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:58,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 961405722, now seen corresponding path program 1 times [2025-02-08 04:47:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062895688] [2025-02-08 04:47:58,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:58,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 04:47:58,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 04:47:58,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:58,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 363 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-02-08 04:47:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062895688] [2025-02-08 04:47:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062895688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:47:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991706594] [2025-02-08 04:47:59,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:59,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:47:59,044 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-08 04:47:59,046 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-08 04:47:59,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 04:48:00,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 04:48:00,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:48:00,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:48:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 3255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 04:48:00,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:48:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:48:01,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:48:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:48:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991706594] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:48:01,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:48:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-08 04:48:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400840878] [2025-02-08 04:48:01,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:48:01,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 04:48:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:48:01,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 04:48:01,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 04:48:01,961 INFO L87 Difference]: Start difference. First operand 1672 states and 2324 transitions. Second operand has 14 states, 14 states have (on average 112.14285714285714) internal successors, (1570), 14 states have internal predecessors, (1570), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 04:48:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:48:05,570 INFO L93 Difference]: Finished difference Result 5391 states and 7521 transitions. [2025-02-08 04:48:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 04:48:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 112.14285714285714) internal successors, (1570), 14 states have internal predecessors, (1570), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 665 [2025-02-08 04:48:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:48:05,592 INFO L225 Difference]: With dead ends: 5391 [2025-02-08 04:48:05,592 INFO L226 Difference]: Without dead ends: 4331 [2025-02-08 04:48:05,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1344 GetRequests, 1320 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-02-08 04:48:05,596 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 19267 mSDsluCounter, 5112 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19267 SdHoareTripleChecker+Valid, 6160 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:48:05,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19267 Valid, 6160 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 04:48:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2025-02-08 04:48:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 3476. [2025-02-08 04:48:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3426 states have (on average 1.377699941622884) internal successors, (4720), 3431 states have internal predecessors, (4720), 47 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-08 04:48:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 4809 transitions. [2025-02-08 04:48:05,703 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 4809 transitions. Word has length 665 [2025-02-08 04:48:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:48:05,704 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 4809 transitions. [2025-02-08 04:48:05,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 112.14285714285714) internal successors, (1570), 14 states have internal predecessors, (1570), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 04:48:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 4809 transitions. [2025-02-08 04:48:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1540 [2025-02-08 04:48:05,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:48:05,777 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:48:05,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 04:48:05,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 04:48:05,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:48:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:48:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash 903045620, now seen corresponding path program 1 times [2025-02-08 04:48:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:48:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568422816] [2025-02-08 04:48:05,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:48:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:48:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1539 statements into 1 equivalence classes.