./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.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_FNV_test9-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:51:56,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:51:56,995 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:51:57,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:51:57,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:51:57,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:51:57,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:51:57,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:51:57,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:51:57,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:51:57,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:51:57,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:51:57,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:51:57,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:51:57,031 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:51:57,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:51:57,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:51:57,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:51:57,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:51:57,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:51:57,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:51:57,034 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 -> 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 [2025-02-08 04:51:57,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:51:57,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:51:57,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:51:57,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:51:57,356 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:51:57,358 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_FNV_test9-1.i [2025-02-08 04:51:58,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d19ae84eb/d4236d2580cc47ebb1ef5a296d81756e/FLAG7ddab390f [2025-02-08 04:51:59,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:51:59,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-02-08 04:51:59,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d19ae84eb/d4236d2580cc47ebb1ef5a296d81756e/FLAG7ddab390f [2025-02-08 04:51:59,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d19ae84eb/d4236d2580cc47ebb1ef5a296d81756e [2025-02-08 04:51:59,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:51:59,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:51:59,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:51:59,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:51:59,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:51:59,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:51:59" (1/1) ... [2025-02-08 04:51:59,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a85ed23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:59, skipping insertion in model container [2025-02-08 04:51:59,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:51:59" (1/1) ... [2025-02-08 04:51:59,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:51:59,651 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_FNV_test9-1.i[33021,33034] [2025-02-08 04:51:59,857 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_FNV_test9-1.i[84583,84596] [2025-02-08 04:51:59,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:51:59,877 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:51:59,912 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_FNV_test9-1.i[33021,33034] [2025-02-08 04:52:00,012 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_FNV_test9-1.i[84583,84596] [2025-02-08 04:52:00,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:52:00,045 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:52:00,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00 WrapperNode [2025-02-08 04:52:00,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:52:00,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:52:00,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:52:00,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:52:00,051 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:52:00" (1/1) ... [2025-02-08 04:52:00,088 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:52:00" (1/1) ... [2025-02-08 04:52:00,193 INFO L138 Inliner]: procedures = 177, calls = 722, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-02-08 04:52:00,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:52:00,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:52:00,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:52:00,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:52:00,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,337 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [34, 2, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2025-02-08 04:52:00,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:52:00,462 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:52:00,463 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:52:00,463 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:52:00,464 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (1/1) ... [2025-02-08 04:52:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:52:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:00,498 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:52:00,506 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:52:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:52:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:52:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:52:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:52:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:52:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:52:00,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:52:00,744 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:52:00,746 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:52:03,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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:52:03,648 INFO L? ?]: Removed 796 outVars from TransFormulas that were not future-live. [2025-02-08 04:52:03,650 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:52:03,735 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:52:03,735 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:52:03,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:52:03 BoogieIcfgContainer [2025-02-08 04:52:03,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:52:03,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:52:03,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:52:03,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:52:03,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:51:59" (1/3) ... [2025-02-08 04:52:03,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515d4a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:52:03, skipping insertion in model container [2025-02-08 04:52:03,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:00" (2/3) ... [2025-02-08 04:52:03,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515d4a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:52:03, skipping insertion in model container [2025-02-08 04:52:03,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:52:03" (3/3) ... [2025-02-08 04:52:03,746 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-1.i [2025-02-08 04:52:03,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:52:03,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-1.i that has 5 procedures, 1374 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-08 04:52:03,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:52:03,861 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;@6976474a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:52:03,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 04:52:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 1366 states, 857 states have (on average 1.840140023337223) internal successors, (1577), 1359 states have internal predecessors, (1577), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-08 04:52:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 04:52:03,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:03,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:52:03,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1169923548, now seen corresponding path program 1 times [2025-02-08 04:52:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591993752] [2025-02-08 04:52:03,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:03,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 04:52:03,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 04:52:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:04,029 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:52:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591993752] [2025-02-08 04:52:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591993752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:52:04,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090275822] [2025-02-08 04:52:04,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:52:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:52:04,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:52:04,057 INFO L87 Difference]: Start difference. First operand has 1366 states, 857 states have (on average 1.840140023337223) internal successors, (1577), 1359 states have internal predecessors, (1577), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) 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:52:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:04,373 INFO L93 Difference]: Finished difference Result 2731 states and 5665 transitions. [2025-02-08 04:52:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:52:04,376 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:52:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:04,404 INFO L225 Difference]: With dead ends: 2731 [2025-02-08 04:52:04,405 INFO L226 Difference]: Without dead ends: 1359 [2025-02-08 04:52:04,422 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:52:04,425 INFO L435 NwaCegarLoop]: 2486 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:04,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2486 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:52:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-08 04:52:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1359. [2025-02-08 04:52:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 853 states have (on average 1.776084407971864) internal successors, (1515), 1353 states have internal predecessors, (1515), 503 states have call successors, (503), 2 states have call predecessors, (503), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:52:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2021 transitions. [2025-02-08 04:52:04,548 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2021 transitions. Word has length 8 [2025-02-08 04:52:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:04,549 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2021 transitions. [2025-02-08 04:52:04,549 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:52:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2021 transitions. [2025-02-08 04:52:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 04:52:04,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:04,555 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:52:04,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:52:04,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:04,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash 12516499, now seen corresponding path program 1 times [2025-02-08 04:52:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253659657] [2025-02-08 04:52:04,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:04,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 04:52:04,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 04:52:04,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:04,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:05,133 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:52:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253659657] [2025-02-08 04:52:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253659657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:05,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:52:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680584523] [2025-02-08 04:52:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:52:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:05,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:52:05,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:52:05,138 INFO L87 Difference]: Start difference. First operand 1359 states and 2021 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:52:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:06,187 INFO L93 Difference]: Finished difference Result 3869 states and 5768 transitions. [2025-02-08 04:52:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:52:06,188 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:52:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:06,209 INFO L225 Difference]: With dead ends: 3869 [2025-02-08 04:52:06,210 INFO L226 Difference]: Without dead ends: 2708 [2025-02-08 04:52:06,215 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:52:06,216 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1503 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 5455 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:06,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 5455 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 04:52:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-02-08 04:52:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 1361. [2025-02-08 04:52:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 855 states have (on average 1.774269005847953) internal successors, (1517), 1355 states have internal predecessors, (1517), 503 states have call successors, (503), 2 states have call predecessors, (503), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:52:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2023 transitions. [2025-02-08 04:52:06,286 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2023 transitions. Word has length 62 [2025-02-08 04:52:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 2023 transitions. [2025-02-08 04:52:06,287 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:52:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2023 transitions. [2025-02-08 04:52:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 04:52:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:06,295 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:52:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:52:06,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -428969254, now seen corresponding path program 1 times [2025-02-08 04:52:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842491527] [2025-02-08 04:52:06,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 04:52:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 04:52:06,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:06,760 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:52:06,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842491527] [2025-02-08 04:52:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842491527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:52:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775740528] [2025-02-08 04:52:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:52:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:52:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:52:06,763 INFO L87 Difference]: Start difference. First operand 1361 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 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:52:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:06,973 INFO L93 Difference]: Finished difference Result 2677 states and 3977 transitions. [2025-02-08 04:52:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:52:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 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:52:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:06,985 INFO L225 Difference]: With dead ends: 2677 [2025-02-08 04:52:06,985 INFO L226 Difference]: Without dead ends: 1319 [2025-02-08 04:52:06,990 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:52:06,994 INFO L435 NwaCegarLoop]: 1888 mSDtfsCounter, 30 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5645 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:06,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5645 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:52:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-02-08 04:52:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2025-02-08 04:52:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 813 states have (on average 1.7712177121771218) internal successors, (1440), 1313 states have internal predecessors, (1440), 503 states have call successors, (503), 2 states have call predecessors, (503), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:52:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1946 transitions. [2025-02-08 04:52:07,048 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1946 transitions. Word has length 137 [2025-02-08 04:52:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:07,048 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1946 transitions. [2025-02-08 04:52:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 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:52:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1946 transitions. [2025-02-08 04:52:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 04:52:07,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:07,054 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:52:07,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:52:07,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:07,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1388049684, now seen corresponding path program 1 times [2025-02-08 04:52:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081434109] [2025-02-08 04:52:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:07,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 04:52:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 04:52:07,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:07,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:07,334 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:52:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081434109] [2025-02-08 04:52:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081434109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:52:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347885290] [2025-02-08 04:52:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:52:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:52:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:52:07,337 INFO L87 Difference]: Start difference. First operand 1319 states and 1946 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:52:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:07,575 INFO L93 Difference]: Finished difference Result 3856 states and 5709 transitions. [2025-02-08 04:52:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:52:07,575 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:52:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:07,592 INFO L225 Difference]: With dead ends: 3856 [2025-02-08 04:52:07,593 INFO L226 Difference]: Without dead ends: 2540 [2025-02-08 04:52:07,599 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:52:07,600 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 1258 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 3972 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:52:07,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 3972 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:52:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2025-02-08 04:52:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2038. [2025-02-08 04:52:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 1532 states have (on average 1.7996083550913837) internal successors, (2757), 2032 states have internal predecessors, (2757), 503 states have call successors, (503), 2 states have call predecessors, (503), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:52:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 3263 transitions. [2025-02-08 04:52:07,673 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 3263 transitions. Word has length 137 [2025-02-08 04:52:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:07,674 INFO L471 AbstractCegarLoop]: Abstraction has 2038 states and 3263 transitions. [2025-02-08 04:52:07,674 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:52:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 3263 transitions. [2025-02-08 04:52:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:52:07,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:07,676 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:52:07,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:52:07,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:07,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1760148253, now seen corresponding path program 1 times [2025-02-08 04:52:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321622204] [2025-02-08 04:52:07,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:07,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:52:07,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:52:07,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:07,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:07,990 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:52:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:07,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321622204] [2025-02-08 04:52:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321622204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:07,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:52:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725091113] [2025-02-08 04:52:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:07,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:52:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:07,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:52:07,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:52:07,994 INFO L87 Difference]: Start difference. First operand 2038 states and 3263 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:52:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:08,161 INFO L93 Difference]: Finished difference Result 3747 states and 6065 transitions. [2025-02-08 04:52:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:52:08,162 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:52:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:08,179 INFO L225 Difference]: With dead ends: 3747 [2025-02-08 04:52:08,181 INFO L226 Difference]: Without dead ends: 1954 [2025-02-08 04:52:08,188 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:52:08,189 INFO L435 NwaCegarLoop]: 1814 mSDtfsCounter, 30 mSDsluCounter, 3609 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5423 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:52:08,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5423 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:52:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-02-08 04:52:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954. [2025-02-08 04:52:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1448 states have (on average 1.7976519337016574) internal successors, (2603), 1948 states have internal predecessors, (2603), 503 states have call successors, (503), 2 states have call predecessors, (503), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:52:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 3109 transitions. [2025-02-08 04:52:08,255 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 3109 transitions. Word has length 152 [2025-02-08 04:52:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 3109 transitions. [2025-02-08 04:52:08,256 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:52:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 3109 transitions. [2025-02-08 04:52:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:52:08,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:08,272 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:52:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:52:08,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:08,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash -884325316, now seen corresponding path program 1 times [2025-02-08 04:52:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:08,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495799978] [2025-02-08 04:52:08,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:08,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:52:08,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:52:08,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:08,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:08,577 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:52:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:08,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495799978] [2025-02-08 04:52:08,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495799978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:08,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:52:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648158758] [2025-02-08 04:52:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:08,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:52:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:52:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:52:08,580 INFO L87 Difference]: Start difference. First operand 1954 states and 3109 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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:52:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:09,128 INFO L93 Difference]: Finished difference Result 4397 states and 6703 transitions. [2025-02-08 04:52:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:52:09,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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:52:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:09,148 INFO L225 Difference]: With dead ends: 4397 [2025-02-08 04:52:09,148 INFO L226 Difference]: Without dead ends: 2532 [2025-02-08 04:52:09,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:52:09,156 INFO L435 NwaCegarLoop]: 1920 mSDtfsCounter, 4862 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4863 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:09,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4863 Valid, 4321 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:52:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2025-02-08 04:52:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1363. [2025-02-08 04:52:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 857 states have (on average 1.7246207701283547) internal successors, (1478), 1357 states have internal predecessors, (1478), 503 states have call successors, (503), 2 states have call predecessors, (503), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:52:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1984 transitions. [2025-02-08 04:52:09,275 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1984 transitions. Word has length 152 [2025-02-08 04:52:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:09,275 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1984 transitions. [2025-02-08 04:52:09,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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:52:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1984 transitions. [2025-02-08 04:52:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 04:52:09,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:09,278 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:52:09,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:52:09,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1729142862, now seen corresponding path program 1 times [2025-02-08 04:52:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:09,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678049569] [2025-02-08 04:52:09,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:52:09,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:52:09,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:09,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:10,138 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:52:10,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678049569] [2025-02-08 04:52:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678049569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:52:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161254161] [2025-02-08 04:52:10,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:52:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:10,143 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:52:10,145 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:52:10,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:52:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:52:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:10,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 04:52:10,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:52:10,507 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:52:10,738 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:52:10,766 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:52:10,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:52:10,968 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:52:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161254161] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:52:10,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:52:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-02-08 04:52:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19511996] [2025-02-08 04:52:10,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:52:10,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 04:52:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:10,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 04:52:10,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:52:10,970 INFO L87 Difference]: Start difference. First operand 1363 states and 1984 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:52:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:14,105 INFO L93 Difference]: Finished difference Result 5196 states and 7600 transitions. [2025-02-08 04:52:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:52:14,106 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:52:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:14,135 INFO L225 Difference]: With dead ends: 5196 [2025-02-08 04:52:14,135 INFO L226 Difference]: Without dead ends: 4077 [2025-02-08 04:52:14,140 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:52:14,142 INFO L435 NwaCegarLoop]: 1982 mSDtfsCounter, 4133 mSDsluCounter, 8880 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4137 SdHoareTripleChecker+Valid, 10862 SdHoareTripleChecker+Invalid, 3351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:14,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4137 Valid, 10862 Invalid, 3351 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [506 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-08 04:52:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2025-02-08 04:52:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 1705. [2025-02-08 04:52:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1195 states have (on average 1.6150627615062763) internal successors, (1930), 1695 states have internal predecessors, (1930), 506 states have call successors, (506), 3 states have call predecessors, (506), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:52:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2442 transitions. [2025-02-08 04:52:14,247 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2442 transitions. Word has length 162 [2025-02-08 04:52:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:14,248 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2442 transitions. [2025-02-08 04:52:14,248 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:52:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2442 transitions. [2025-02-08 04:52:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-08 04:52:14,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:14,257 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:52:14,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 04:52:14,462 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:52:14,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1274473359, now seen corresponding path program 1 times [2025-02-08 04:52:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257106336] [2025-02-08 04:52:14,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:14,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:52:14,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:52:14,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:14,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:18,053 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:52:18,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:18,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257106336] [2025-02-08 04:52:18,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257106336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:52:18,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992255984] [2025-02-08 04:52:18,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:18,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:52:18,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:18,058 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:52:18,060 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:52:18,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:52:18,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:52:18,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:18,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:18,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 04:52:18,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:52:18,774 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:52:18,975 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:52:19,102 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:52:19,214 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:52:19,339 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:52:19,359 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:52:19,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:52:19,882 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:52:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992255984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:52:19,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:52:19,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2025-02-08 04:52:19,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889451875] [2025-02-08 04:52:19,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:52:19,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 04:52:19,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:19,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 04:52:19,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-02-08 04:52:19,887 INFO L87 Difference]: Start difference. First operand 1705 states and 2442 transitions. Second operand has 24 states, 24 states have (on average 41.541666666666664) internal successors, (997), 24 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:52:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:25,382 INFO L93 Difference]: Finished difference Result 10504 states and 15361 transitions. [2025-02-08 04:52:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 04:52:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 41.541666666666664) internal successors, (997), 24 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:52:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:25,436 INFO L225 Difference]: With dead ends: 10504 [2025-02-08 04:52:25,436 INFO L226 Difference]: Without dead ends: 9385 [2025-02-08 04:52:25,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 763 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 04:52:25,446 INFO L435 NwaCegarLoop]: 5746 mSDtfsCounter, 19955 mSDsluCounter, 35761 mSDsCounter, 0 mSdLazyCounter, 6846 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19965 SdHoareTripleChecker+Valid, 41507 SdHoareTripleChecker+Invalid, 7374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 6846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:25,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19965 Valid, 41507 Invalid, 7374 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [528 Valid, 6846 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 04:52:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2025-02-08 04:52:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 2557. [2025-02-08 04:52:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2041 states have (on average 1.5012248897599216) internal successors, (3064), 2541 states have internal predecessors, (3064), 512 states have call successors, (512), 3 states have call predecessors, (512), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:52:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3588 transitions. [2025-02-08 04:52:25,646 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3588 transitions. Word has length 387 [2025-02-08 04:52:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:25,647 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3588 transitions. [2025-02-08 04:52:25,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 41.541666666666664) internal successors, (997), 24 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:52:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3588 transitions. [2025-02-08 04:52:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-08 04:52:25,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:25,666 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:52:25,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 04:52:25,868 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:52:25,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:25,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 413674351, now seen corresponding path program 2 times [2025-02-08 04:52:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567303982] [2025-02-08 04:52:25,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:52:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:26,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 837 statements into 2 equivalence classes. [2025-02-08 04:52:26,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 837 statements. [2025-02-08 04:52:26,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:52:26,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:26,423 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:52:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567303982] [2025-02-08 04:52:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567303982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:26,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:52:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:52:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870849599] [2025-02-08 04:52:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:52:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:26,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:52:26,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:52:26,428 INFO L87 Difference]: Start difference. First operand 2557 states and 3588 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:52:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:26,896 INFO L93 Difference]: Finished difference Result 3680 states and 5252 transitions. [2025-02-08 04:52:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:52:26,896 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:52:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:26,909 INFO L225 Difference]: With dead ends: 3680 [2025-02-08 04:52:26,909 INFO L226 Difference]: Without dead ends: 2562 [2025-02-08 04:52:26,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:52:26,915 INFO L435 NwaCegarLoop]: 1818 mSDtfsCounter, 14 mSDsluCounter, 7008 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8826 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:52:26,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8826 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:52:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-02-08 04:52:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2559. [2025-02-08 04:52:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2043 states have (on average 1.500734214390602) internal successors, (3066), 2543 states have internal predecessors, (3066), 512 states have call successors, (512), 3 states have call predecessors, (512), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:52:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3590 transitions. [2025-02-08 04:52:27,048 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3590 transitions. Word has length 837 [2025-02-08 04:52:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 3590 transitions. [2025-02-08 04:52:27,049 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:52:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3590 transitions. [2025-02-08 04:52:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-08 04:52:27,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:27,101 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:52:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:52:27,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:27,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1899683036, now seen corresponding path program 1 times [2025-02-08 04:52:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736692068] [2025-02-08 04:52:27,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:27,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-08 04:52:27,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-08 04:52:27,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:27,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:52:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736692068] [2025-02-08 04:52:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736692068] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:52:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814490061] [2025-02-08 04:52:39,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:39,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:52:39,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:39,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:52:39,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 04:52:40,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-08 04:52:40,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-08 04:52:40,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:40,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:40,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 4161 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 04:52:40,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:52:40,958 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:52:41,217 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:52:41,352 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:52:41,489 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:52:41,623 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:52:41,764 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:52:41,900 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:52:42,029 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:52:42,158 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:52:42,286 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:52:42,412 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:52:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:52:42,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:52:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:52:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814490061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:52:43,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:52:43,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 48 [2025-02-08 04:52:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556499371] [2025-02-08 04:52:43,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:52:43,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 04:52:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:43,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 04:52:43,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=1501, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 04:52:43,859 INFO L87 Difference]: Start difference. First operand 2559 states and 3590 transitions. Second operand has 48 states, 48 states have (on average 48.916666666666664) internal successors, (2348), 48 states have internal predecessors, (2348), 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)