./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.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_test2-2.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 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:46:40,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:46:40,255 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:46:40,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:46:40,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:46:40,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:46:40,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:46:40,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:46:40,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:46:40,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:46:40,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:46:40,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:46:40,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:46:40,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:46:40,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:46:40,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:46:40,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:46:40,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:46:40,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:46:40,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:46:40,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:46:40,291 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 -> 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 [2025-02-08 04:46:40,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:46:40,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:46:40,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:46:40,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:46:40,563 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:46:40,565 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_test2-2.i [2025-02-08 04:46:41,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cec63ee21/38e56538dc2e4f1fb8431d1a25f6ff32/FLAG3e7028e26 [2025-02-08 04:46:42,110 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:46:42,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2025-02-08 04:46:42,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cec63ee21/38e56538dc2e4f1fb8431d1a25f6ff32/FLAG3e7028e26 [2025-02-08 04:46:42,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cec63ee21/38e56538dc2e4f1fb8431d1a25f6ff32 [2025-02-08 04:46:42,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:46:42,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:46:42,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:46:42,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:46:42,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:46:42,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:46:42" (1/1) ... [2025-02-08 04:46:42,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5418f179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:42, skipping insertion in model container [2025-02-08 04:46:42,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:46:42" (1/1) ... [2025-02-08 04:46:42,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:46:42,789 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_test2-2.i[37019,37032] [2025-02-08 04:46:42,890 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_test2-2.i[47352,47365] [2025-02-08 04:46:42,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:46:42,918 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:46:42,955 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_test2-2.i[37019,37032] [2025-02-08 04:46:43,017 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_test2-2.i[47352,47365] [2025-02-08 04:46:43,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:46:43,066 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:46:43,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43 WrapperNode [2025-02-08 04:46:43,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:46:43,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:46:43,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:46:43,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:46:43,075 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:46:43" (1/1) ... [2025-02-08 04:46:43,099 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:46:43" (1/1) ... [2025-02-08 04:46:43,157 INFO L138 Inliner]: procedures = 208, calls = 278, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1423 [2025-02-08 04:46:43,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:46:43,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:46:43,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:46:43,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:46:43,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,251 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-08 04:46:43,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:46:43,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:46:43,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:46:43,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:46:43,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (1/1) ... [2025-02-08 04:46:43,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:46:43,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:46:43,344 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:46:43,347 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:46:43,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:46:43,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:46:43,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:46:43,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:46:43,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:46:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:46:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:46:43,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:46:43,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:46:43,595 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:46:44,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:46:44,992 INFO L? ?]: Removed 327 outVars from TransFormulas that were not future-live. [2025-02-08 04:46:44,992 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:46:45,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:46:45,061 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:46:45,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:46:45 BoogieIcfgContainer [2025-02-08 04:46:45,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:46:45,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:46:45,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:46:45,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:46:45,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:46:42" (1/3) ... [2025-02-08 04:46:45,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b72ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:46:45, skipping insertion in model container [2025-02-08 04:46:45,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:43" (2/3) ... [2025-02-08 04:46:45,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b72ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:46:45, skipping insertion in model container [2025-02-08 04:46:45,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:46:45" (3/3) ... [2025-02-08 04:46:45,069 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-2.i [2025-02-08 04:46:45,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:46:45,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test2-2.i that has 5 procedures, 417 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-02-08 04:46:45,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:46:45,163 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;@3fb7344d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:46:45,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 04:46:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 395 states have (on average 1.6227848101265823) internal successors, (641), 402 states have internal predecessors, (641), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 04:46:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 04:46:45,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:45,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:46:45,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash -15238052, now seen corresponding path program 1 times [2025-02-08 04:46:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255028919] [2025-02-08 04:46:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:45,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 04:46:45,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 04:46:45,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:45,313 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:46:45,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:45,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255028919] [2025-02-08 04:46:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255028919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:45,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:45,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:46:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977369877] [2025-02-08 04:46:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:46:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:45,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:46:45,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:46:45,343 INFO L87 Difference]: Start difference. First operand has 409 states, 395 states have (on average 1.6227848101265823) internal successors, (641), 402 states have internal predecessors, (641), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:46:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:45,459 INFO L93 Difference]: Finished difference Result 817 states and 1318 transitions. [2025-02-08 04:46:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:46:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-02-08 04:46:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:45,472 INFO L225 Difference]: With dead ends: 817 [2025-02-08 04:46:45,472 INFO L226 Difference]: Without dead ends: 369 [2025-02-08 04:46:45,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:46:45,479 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:45,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:46:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-08 04:46:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-02-08 04:46:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 358 states have (on average 1.4664804469273742) internal successors, (525), 363 states have internal predecessors, (525), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:46:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2025-02-08 04:46:45,547 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 8 [2025-02-08 04:46:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:45,547 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2025-02-08 04:46:45,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:46:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2025-02-08 04:46:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 04:46:45,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:45,551 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] [2025-02-08 04:46:45,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:46:45,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:45,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1899629325, now seen corresponding path program 1 times [2025-02-08 04:46:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:45,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619759535] [2025-02-08 04:46:45,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:45,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 04:46:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 04:46:45,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:45,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:46,044 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:46:46,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619759535] [2025-02-08 04:46:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619759535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:46,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:46:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68880019] [2025-02-08 04:46:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:46,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:46,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:46,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:46,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:46,047 INFO L87 Difference]: Start difference. First operand 369 states and 536 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:46:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:46,353 INFO L93 Difference]: Finished difference Result 899 states and 1313 transitions. [2025-02-08 04:46:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:46:46,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-02-08 04:46:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:46,359 INFO L225 Difference]: With dead ends: 899 [2025-02-08 04:46:46,359 INFO L226 Difference]: Without dead ends: 728 [2025-02-08 04:46:46,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:46:46,361 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 513 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:46,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1495 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:46:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-02-08 04:46:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 371. [2025-02-08 04:46:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 365 states have internal predecessors, (527), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:46:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 538 transitions. [2025-02-08 04:46:46,392 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 538 transitions. Word has length 62 [2025-02-08 04:46:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:46,393 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 538 transitions. [2025-02-08 04:46:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:46:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 538 transitions. [2025-02-08 04:46:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 04:46:46,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:46,399 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:46:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:46:46,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:46,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1256326455, now seen corresponding path program 1 times [2025-02-08 04:46:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086309306] [2025-02-08 04:46:46,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:46,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 04:46:46,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 04:46:46,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:46,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086309306] [2025-02-08 04:46:46,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086309306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:46,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:46,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:46:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562349605] [2025-02-08 04:46:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:46,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:46:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:46,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:46:46,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:46,848 INFO L87 Difference]: Start difference. First operand 371 states and 538 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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:46:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:47,032 INFO L93 Difference]: Finished difference Result 697 states and 1007 transitions. [2025-02-08 04:46:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:46:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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 137 [2025-02-08 04:46:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:47,034 INFO L225 Difference]: With dead ends: 697 [2025-02-08 04:46:47,034 INFO L226 Difference]: Without dead ends: 329 [2025-02-08 04:46:47,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:47,036 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 12 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:47,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1581 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:46:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-08 04:46:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-02-08 04:46:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 318 states have (on average 1.4150943396226414) internal successors, (450), 323 states have internal predecessors, (450), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:46:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 461 transitions. [2025-02-08 04:46:47,057 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 461 transitions. Word has length 137 [2025-02-08 04:46:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:47,057 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 461 transitions. [2025-02-08 04:46:47,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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:46:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 461 transitions. [2025-02-08 04:46:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 04:46:47,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:47,063 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:46:47,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:46:47,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1144065231, now seen corresponding path program 1 times [2025-02-08 04:46:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24100897] [2025-02-08 04:46:47,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:47,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 04:46:47,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 04:46:47,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24100897] [2025-02-08 04:46:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24100897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:47,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:47,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:46:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923397099] [2025-02-08 04:46:47,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:47,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:46:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:47,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:46:47,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:46:47,336 INFO L87 Difference]: Start difference. First operand 329 states and 461 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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:46:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:47,490 INFO L93 Difference]: Finished difference Result 886 states and 1254 transitions. [2025-02-08 04:46:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:46:47,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 137 [2025-02-08 04:46:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:47,493 INFO L225 Difference]: With dead ends: 886 [2025-02-08 04:46:47,493 INFO L226 Difference]: Without dead ends: 560 [2025-02-08 04:46:47,494 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:46:47,494 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 268 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:47,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1002 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:46:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-08 04:46:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 553. [2025-02-08 04:46:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 542 states have (on average 1.433579335793358) internal successors, (777), 547 states have internal predecessors, (777), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:46:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 788 transitions. [2025-02-08 04:46:47,508 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 788 transitions. Word has length 137 [2025-02-08 04:46:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:47,508 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 788 transitions. [2025-02-08 04:46:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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:46:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 788 transitions. [2025-02-08 04:46:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:46:47,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:47,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:46:47,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:46:47,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:47,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1561620547, now seen corresponding path program 1 times [2025-02-08 04:46:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678406594] [2025-02-08 04:46:47,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:47,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:46:47,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:46:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:47,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:46:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:47,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678406594] [2025-02-08 04:46:47,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678406594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:47,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:46:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066842060] [2025-02-08 04:46:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:47,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:47,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:47,828 INFO L87 Difference]: Start difference. First operand 553 states and 788 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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:46:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:47,946 INFO L93 Difference]: Finished difference Result 777 states and 1115 transitions. [2025-02-08 04:46:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:46:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 152 [2025-02-08 04:46:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:47,951 INFO L225 Difference]: With dead ends: 777 [2025-02-08 04:46:47,951 INFO L226 Difference]: Without dead ends: 469 [2025-02-08 04:46:47,955 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:46:47,955 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 30 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:47,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 968 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:46:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-08 04:46:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-02-08 04:46:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 458 states have (on average 1.3602620087336244) internal successors, (623), 463 states have internal predecessors, (623), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:46:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 634 transitions. [2025-02-08 04:46:47,972 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 634 transitions. Word has length 152 [2025-02-08 04:46:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:47,972 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 634 transitions. [2025-02-08 04:46:47,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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:46:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 634 transitions. [2025-02-08 04:46:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:46:47,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:47,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:46:47,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:46:47,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1857523812, now seen corresponding path program 1 times [2025-02-08 04:46:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:47,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476316181] [2025-02-08 04:46:47,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:48,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:46:48,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:46:48,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:48,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:48,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476316181] [2025-02-08 04:46:48,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476316181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:48,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:48,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:46:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009577142] [2025-02-08 04:46:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:48,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:48,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:48,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:48,229 INFO L87 Difference]: Start difference. First operand 469 states and 634 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:46:49,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:46:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:49,715 INFO L93 Difference]: Finished difference Result 753 states and 1015 transitions. [2025-02-08 04:46:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:46:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 152 [2025-02-08 04:46:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:49,718 INFO L225 Difference]: With dead ends: 753 [2025-02-08 04:46:49,718 INFO L226 Difference]: Without dead ends: 373 [2025-02-08 04:46:49,719 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:46:49,720 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 559 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:49,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 542 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 04:46:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-08 04:46:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-02-08 04:46:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 362 states have (on average 1.3480662983425415) internal successors, (488), 367 states have internal predecessors, (488), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:46:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 499 transitions. [2025-02-08 04:46:49,741 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 499 transitions. Word has length 152 [2025-02-08 04:46:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:49,742 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 499 transitions. [2025-02-08 04:46:49,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:46:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 499 transitions. [2025-02-08 04:46:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 04:46:49,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:49,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:46:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:46:49,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1496638926, now seen corresponding path program 1 times [2025-02-08 04:46:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024142332] [2025-02-08 04:46:49,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:49,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:46:49,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:46:49,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:49,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:50,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:50,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024142332] [2025-02-08 04:46:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024142332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:46:50,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249789868] [2025-02-08 04:46:50,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:50,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:46:50,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:46:50,343 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:46:50,344 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:46:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:46:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:46:50,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:50,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:50,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 04:46:50,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:46:50,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:46:50,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:46:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:50,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:46:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249789868] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:46:51,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:46:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-02-08 04:46:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044834172] [2025-02-08 04:46:51,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:46:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 04:46:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:51,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 04:46:51,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:46:51,132 INFO L87 Difference]: Start difference. First operand 373 states and 499 transitions. Second operand has 12 states, 12 states have (on average 26.833333333333332) internal successors, (322), 12 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:46:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:51,573 INFO L93 Difference]: Finished difference Result 1236 states and 1660 transitions. [2025-02-08 04:46:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:46:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.833333333333332) internal successors, (322), 12 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2025-02-08 04:46:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:51,578 INFO L225 Difference]: With dead ends: 1236 [2025-02-08 04:46:51,578 INFO L226 Difference]: Without dead ends: 1107 [2025-02-08 04:46:51,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-08 04:46:51,579 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 1081 mSDsluCounter, 3388 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 3885 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-02-08 04:46:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 715. [2025-02-08 04:46:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 700 states have (on average 1.3428571428571427) internal successors, (940), 705 states have internal predecessors, (940), 11 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:46:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 957 transitions. [2025-02-08 04:46:51,604 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 957 transitions. Word has length 162 [2025-02-08 04:46:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 957 transitions. [2025-02-08 04:46:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.833333333333332) internal successors, (322), 12 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:46:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 957 transitions. [2025-02-08 04:46:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-08 04:46:51,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:51,612 INFO L218 NwaCegarLoop]: trace histogram [5, 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, 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] [2025-02-08 04:46:51,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:46:51,812 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:46:51,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1967961260, now seen corresponding path program 1 times [2025-02-08 04:46:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098558474] [2025-02-08 04:46:51,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:51,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:46:52,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:46:52,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:52,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098558474] [2025-02-08 04:46:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098558474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:46:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125666370] [2025-02-08 04:46:54,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:54,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:46:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:46:54,482 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:46:54,484 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:46:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:46:55,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:46:55,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:55,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:55,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 04:46:55,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:46:55,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:46:55,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:46:55,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:46:55,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:46:55,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:46:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:55,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:46:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:56,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125666370] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:46:56,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:46:56,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-02-08 04:46:56,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705993218] [2025-02-08 04:46:56,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:46:56,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 04:46:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 04:46:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-08 04:46:56,124 INFO L87 Difference]: Start difference. First operand 715 states and 957 transitions. Second operand has 23 states, 23 states have (on average 43.34782608695652) internal successors, (997), 23 states have internal predecessors, (997), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:46:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:57,239 INFO L93 Difference]: Finished difference Result 2460 states and 3313 transitions. [2025-02-08 04:46:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 04:46:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.34782608695652) internal successors, (997), 23 states have internal predecessors, (997), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 387 [2025-02-08 04:46:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:57,248 INFO L225 Difference]: With dead ends: 2460 [2025-02-08 04:46:57,249 INFO L226 Difference]: Without dead ends: 2331 [2025-02-08 04:46:57,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 762 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-08 04:46:57,251 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 4571 mSDsluCounter, 9706 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 10997 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:57,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 10997 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 04:46:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-02-08 04:46:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1567. [2025-02-08 04:46:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1546 states have (on average 1.3415265200517466) internal successors, (2074), 1551 states have internal predecessors, (2074), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:46:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2103 transitions. [2025-02-08 04:46:57,295 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2103 transitions. Word has length 387 [2025-02-08 04:46:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:57,295 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2103 transitions. [2025-02-08 04:46:57,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.34782608695652) internal successors, (997), 23 states have internal predecessors, (997), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:46:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2103 transitions. [2025-02-08 04:46:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-08 04:46:57,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:57,308 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-02-08 04:46:57,318 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:46:57,509 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:46:57,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:57,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1122273516, now seen corresponding path program 2 times [2025-02-08 04:46:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:57,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762641132] [2025-02-08 04:46:57,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:46:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:57,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 837 statements into 2 equivalence classes. [2025-02-08 04:46:57,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 837 statements. [2025-02-08 04:46:57,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:46:57,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 04:46:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762641132] [2025-02-08 04:46:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762641132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:46:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918421341] [2025-02-08 04:46:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:46:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:57,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:46:57,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:46:57,974 INFO L87 Difference]: Start difference. First operand 1567 states and 2103 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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:46:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:58,362 INFO L93 Difference]: Finished difference Result 1700 states and 2282 transitions. [2025-02-08 04:46:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:46:58,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 837 [2025-02-08 04:46:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:58,369 INFO L225 Difference]: With dead ends: 1700 [2025-02-08 04:46:58,370 INFO L226 Difference]: Without dead ends: 1572 [2025-02-08 04:46:58,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:46:58,372 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 14 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:58,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1401 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-02-08 04:46:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1569. [2025-02-08 04:46:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1548 states have (on average 1.3410852713178294) internal successors, (2076), 1553 states have internal predecessors, (2076), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:46:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2105 transitions. [2025-02-08 04:46:58,415 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2105 transitions. Word has length 837 [2025-02-08 04:46:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:58,417 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2105 transitions. [2025-02-08 04:46:58,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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:46:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2105 transitions. [2025-02-08 04:46:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-08 04:46:58,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:58,433 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-02-08 04:46:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:46:58,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1903549540, now seen corresponding path program 1 times [2025-02-08 04:46:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003654687] [2025-02-08 04:46:58,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:58,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes.