./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:59:42,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:59:42,117 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:59:42,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:59:42,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:59:42,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:59:42,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:59:42,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:59:42,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:59:42,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:59:42,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:59:42,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:59:42,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:59:42,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:59:42,136 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:59:42,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:59:42,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:59:42,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:59:42,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:59:42,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:59:42,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:59:42,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:59:42,139 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2025-02-08 04:59:42,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:59:42,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:59:42,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:59:42,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:59:42,370 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:59:42,372 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_SAX_nondet_test2-2.i [2025-02-08 04:59:43,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa2432fa1/20f17d7e6b5c45589a22806bf095f033/FLAGf1531c7cc [2025-02-08 04:59:43,943 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:59:43,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2025-02-08 04:59:43,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa2432fa1/20f17d7e6b5c45589a22806bf095f033/FLAGf1531c7cc [2025-02-08 04:59:43,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa2432fa1/20f17d7e6b5c45589a22806bf095f033 [2025-02-08 04:59:43,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:59:43,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:59:43,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:59:43,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:59:43,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:59:43,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:59:43" (1/1) ... [2025-02-08 04:59:43,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:43, skipping insertion in model container [2025-02-08 04:59:43,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:59:43" (1/1) ... [2025-02-08 04:59:44,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:59:44,327 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_SAX_nondet_test2-2.i[37435,37448] [2025-02-08 04:59:44,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:59:44,425 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:59:44,457 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_SAX_nondet_test2-2.i[37435,37448] [2025-02-08 04:59:44,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:59:44,537 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:59:44,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44 WrapperNode [2025-02-08 04:59:44,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:59:44,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:59:44,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:59:44,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:59:44,546 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:59:44" (1/1) ... [2025-02-08 04:59:44,566 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:59:44" (1/1) ... [2025-02-08 04:59:44,635 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1398 [2025-02-08 04:59:44,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:59:44,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:59:44,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:59:44,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:59:44,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,718 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-08 04:59:44,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:59:44,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:59:44,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:59:44,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:59:44,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (1/1) ... [2025-02-08 04:59:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:59:44,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:44,794 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:59:44,796 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:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:59:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:59:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:59:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:59:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:59:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:59:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:59:44,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:59:44,987 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:59:44,989 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:59:46,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:59:46,144 INFO L? ?]: Removed 320 outVars from TransFormulas that were not future-live. [2025-02-08 04:59:46,144 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:59:46,185 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:59:46,188 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:59:46,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:59:46 BoogieIcfgContainer [2025-02-08 04:59:46,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:59:46,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:59:46,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:59:46,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:59:46,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:59:43" (1/3) ... [2025-02-08 04:59:46,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd249f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:59:46, skipping insertion in model container [2025-02-08 04:59:46,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:44" (2/3) ... [2025-02-08 04:59:46,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd249f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:59:46, skipping insertion in model container [2025-02-08 04:59:46,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:59:46" (3/3) ... [2025-02-08 04:59:46,194 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2025-02-08 04:59:46,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:59:46,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-2.i that has 4 procedures, 402 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-02-08 04:59:46,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:59:46,299 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;@5e3c78c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:59:46,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:59:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 394 states, 388 states have (on average 1.6185567010309279) internal successors, (628), 389 states have internal predecessors, (628), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 04:59:46,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:46,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:46,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:46,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1721049404, now seen corresponding path program 1 times [2025-02-08 04:59:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:46,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678700798] [2025-02-08 04:59:46,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:46,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 04:59:46,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 04:59:46,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:46,444 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:59:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678700798] [2025-02-08 04:59:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678700798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:46,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:59:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715860755] [2025-02-08 04:59:46,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:59:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:46,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:59:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:59:46,464 INFO L87 Difference]: Start difference. First operand has 394 states, 388 states have (on average 1.6185567010309279) internal successors, (628), 389 states have internal predecessors, (628), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:59:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:46,582 INFO L93 Difference]: Finished difference Result 786 states and 1265 transitions. [2025-02-08 04:59:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:59:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2025-02-08 04:59:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:46,593 INFO L225 Difference]: With dead ends: 786 [2025-02-08 04:59:46,593 INFO L226 Difference]: Without dead ends: 357 [2025-02-08 04:59:46,596 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:59:46,598 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:46,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-08 04:59:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-08 04:59:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 520 transitions. [2025-02-08 04:59:46,636 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 520 transitions. Word has length 10 [2025-02-08 04:59:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:46,636 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 520 transitions. [2025-02-08 04:59:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:59:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 520 transitions. [2025-02-08 04:59:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 04:59:46,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:46,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:46,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:59:46,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:46,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1556737427, now seen corresponding path program 1 times [2025-02-08 04:59:46,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:46,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423612115] [2025-02-08 04:59:46,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:46,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 04:59:46,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 04:59:46,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:46,942 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:59:46,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:46,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423612115] [2025-02-08 04:59:46,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423612115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:46,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:46,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556581120] [2025-02-08 04:59:46,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:46,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:46,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:46,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:46,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:46,944 INFO L87 Difference]: Start difference. First operand 357 states and 520 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:59:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:47,075 INFO L93 Difference]: Finished difference Result 472 states and 686 transitions. [2025-02-08 04:59:47,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:59:47,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-02-08 04:59:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:47,077 INFO L225 Difference]: With dead ends: 472 [2025-02-08 04:59:47,077 INFO L226 Difference]: Without dead ends: 315 [2025-02-08 04:59:47,077 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:59:47,078 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 30 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1142 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:59:47,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1142 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-08 04:59:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-02-08 04:59:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.4096774193548387) internal successors, (437), 310 states have internal predecessors, (437), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 443 transitions. [2025-02-08 04:59:47,097 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 443 transitions. Word has length 64 [2025-02-08 04:59:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 443 transitions. [2025-02-08 04:59:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:59:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 443 transitions. [2025-02-08 04:59:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 04:59:47,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:47,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:47,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:59:47,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:47,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash -176030156, now seen corresponding path program 1 times [2025-02-08 04:59:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:47,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11162869] [2025-02-08 04:59:47,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:47,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 04:59:47,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 04:59:47,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:47,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:47,563 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:59:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11162869] [2025-02-08 04:59:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11162869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:59:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375748273] [2025-02-08 04:59:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:59:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:47,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:59:47,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:59:47,565 INFO L87 Difference]: Start difference. First operand 315 states and 443 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:59:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:47,826 INFO L93 Difference]: Finished difference Result 741 states and 1037 transitions. [2025-02-08 04:59:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:59:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2025-02-08 04:59:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:47,829 INFO L225 Difference]: With dead ends: 741 [2025-02-08 04:59:47,829 INFO L226 Difference]: Without dead ends: 623 [2025-02-08 04:59:47,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:59:47,830 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 424 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:47,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1941 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-08 04:59:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 317. [2025-02-08 04:59:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4070512820512822) internal successors, (439), 312 states have internal predecessors, (439), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2025-02-08 04:59:47,852 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 64 [2025-02-08 04:59:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:47,852 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2025-02-08 04:59:47,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:59:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2025-02-08 04:59:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-08 04:59:47,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:47,856 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, 1, 1] [2025-02-08 04:59:47,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:59:47,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1655886431, now seen corresponding path program 1 times [2025-02-08 04:59:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:47,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951863486] [2025-02-08 04:59:47,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:47,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 04:59:47,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 04:59:47,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:48,105 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:59:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951863486] [2025-02-08 04:59:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951863486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:48,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:48,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83644050] [2025-02-08 04:59:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:48,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:48,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:48,107 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:59:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:48,203 INFO L93 Difference]: Finished difference Result 588 states and 820 transitions. [2025-02-08 04:59:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:59:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 139 [2025-02-08 04:59:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:48,204 INFO L225 Difference]: With dead ends: 588 [2025-02-08 04:59:48,204 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 04:59:48,205 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:59:48,205 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 30 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 920 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:59:48,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 920 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 04:59:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-08 04:59:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 270 states have internal predecessors, (362), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 368 transitions. [2025-02-08 04:59:48,211 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 368 transitions. Word has length 139 [2025-02-08 04:59:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 368 transitions. [2025-02-08 04:59:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:59:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 368 transitions. [2025-02-08 04:59:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-08 04:59:48,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:48,213 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, 1, 1] [2025-02-08 04:59:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:59:48,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:48,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1162874201, now seen corresponding path program 1 times [2025-02-08 04:59:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131780669] [2025-02-08 04:59:48,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:48,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 04:59:48,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 04:59:48,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:48,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:48,364 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:59:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131780669] [2025-02-08 04:59:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131780669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:59:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467831969] [2025-02-08 04:59:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:48,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:59:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:48,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:59:48,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:59:48,366 INFO L87 Difference]: Start difference. First operand 275 states and 368 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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:59:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:48,465 INFO L93 Difference]: Finished difference Result 726 states and 976 transitions. [2025-02-08 04:59:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:59:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 139 [2025-02-08 04:59:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:48,467 INFO L225 Difference]: With dead ends: 726 [2025-02-08 04:59:48,467 INFO L226 Difference]: Without dead ends: 455 [2025-02-08 04:59:48,468 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:59:48,468 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 176 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:48,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 747 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-08 04:59:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2025-02-08 04:59:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.3459821428571428) internal successors, (603), 448 states have internal predecessors, (603), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 609 transitions. [2025-02-08 04:59:48,480 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 609 transitions. Word has length 139 [2025-02-08 04:59:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:48,480 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 609 transitions. [2025-02-08 04:59:48,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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:59:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 609 transitions. [2025-02-08 04:59:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 04:59:48,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:48,482 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] [2025-02-08 04:59:48,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:59:48,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:48,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1005723684, now seen corresponding path program 1 times [2025-02-08 04:59:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:48,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178659129] [2025-02-08 04:59:48,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:48,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 04:59:48,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 04:59:48,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:48,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:48,671 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:59:48,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:48,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178659129] [2025-02-08 04:59:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178659129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:48,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:48,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:48,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446874158] [2025-02-08 04:59:48,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:48,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:48,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:48,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:48,673 INFO L87 Difference]: Start difference. First operand 453 states and 609 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:59:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:48,981 INFO L93 Difference]: Finished difference Result 724 states and 973 transitions. [2025-02-08 04:59:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:59:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 154 [2025-02-08 04:59:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:48,983 INFO L225 Difference]: With dead ends: 724 [2025-02-08 04:59:48,983 INFO L226 Difference]: Without dead ends: 361 [2025-02-08 04:59:48,984 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:59:48,984 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 541 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:48,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 512 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:59:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-08 04:59:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-08 04:59:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 356 states have (on average 1.3398876404494382) internal successors, (477), 356 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 483 transitions. [2025-02-08 04:59:48,993 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 483 transitions. Word has length 154 [2025-02-08 04:59:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:48,993 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 483 transitions. [2025-02-08 04:59:48,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:59:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 483 transitions. [2025-02-08 04:59:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 04:59:48,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:48,995 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, 1, 1] [2025-02-08 04:59:48,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:59:48,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 125078226, now seen corresponding path program 1 times [2025-02-08 04:59:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:48,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331350257] [2025-02-08 04:59:48,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:49,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 04:59:49,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 04:59:49,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:49,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:59:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331350257] [2025-02-08 04:59:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331350257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10264812] [2025-02-08 04:59:49,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:49,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:49,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:49,534 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:59:49,538 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:59:49,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 04:59:49,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 04:59:49,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:49,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:49,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 04:59:49,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:49,895 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:59:49,923 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 22 treesize of output 7 [2025-02-08 04:59:50,579 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:59:50,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:59:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10264812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:59:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 04:59:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644731704] [2025-02-08 04:59:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:50,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:59:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:50,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:59:50,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:59:50,581 INFO L87 Difference]: Start difference. First operand 361 states and 483 transitions. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 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:59:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:52,115 INFO L93 Difference]: Finished difference Result 860 states and 1154 transitions. [2025-02-08 04:59:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:59:52,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 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 164 [2025-02-08 04:59:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:52,118 INFO L225 Difference]: With dead ends: 860 [2025-02-08 04:59:52,118 INFO L226 Difference]: Without dead ends: 542 [2025-02-08 04:59:52,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:59:52,122 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 460 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:52,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 2276 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 04:59:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-08 04:59:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 361. [2025-02-08 04:59:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 356 states have (on average 1.3370786516853932) internal successors, (476), 356 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 482 transitions. [2025-02-08 04:59:52,145 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 482 transitions. Word has length 164 [2025-02-08 04:59:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:52,146 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 482 transitions. [2025-02-08 04:59:52,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 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:59:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 482 transitions. [2025-02-08 04:59:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 04:59:52,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:52,149 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, 1, 1, 1] [2025-02-08 04:59:52,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:59:52,350 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:59:52,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:52,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1817937901, now seen corresponding path program 1 times [2025-02-08 04:59:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:52,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234181207] [2025-02-08 04:59:52,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:52,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 04:59:52,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 04:59:52,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:52,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:59:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234181207] [2025-02-08 04:59:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234181207] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329134602] [2025-02-08 04:59:52,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:52,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:52,736 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:59:52,738 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:59:52,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 04:59:53,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 04:59:53,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:53,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:53,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 04:59:53,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:53,064 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:59:53,638 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:59:53,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:59:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329134602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:59:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-08 04:59:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245359920] [2025-02-08 04:59:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:53,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:59:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:53,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:59:53,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:59:53,640 INFO L87 Difference]: Start difference. First operand 361 states and 482 transitions. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 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:59:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:54,319 INFO L93 Difference]: Finished difference Result 657 states and 874 transitions. [2025-02-08 04:59:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:59:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 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 165 [2025-02-08 04:59:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:54,322 INFO L225 Difference]: With dead ends: 657 [2025-02-08 04:59:54,323 INFO L226 Difference]: Without dead ends: 542 [2025-02-08 04:59:54,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-08 04:59:54,324 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 354 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:54,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1921 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:59:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-08 04:59:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 397. [2025-02-08 04:59:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.316326530612245) internal successors, (516), 392 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 522 transitions. [2025-02-08 04:59:54,339 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 522 transitions. Word has length 165 [2025-02-08 04:59:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 522 transitions. [2025-02-08 04:59:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 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:59:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 522 transitions. [2025-02-08 04:59:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 04:59:54,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:54,343 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, 1, 1, 1, 1] [2025-02-08 04:59:54,351 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:59:54,543 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:59:54,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:54,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash 129946582, now seen corresponding path program 1 times [2025-02-08 04:59:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520848923] [2025-02-08 04:59:54,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:54,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 04:59:54,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 04:59:54,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:54,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:59:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520848923] [2025-02-08 04:59:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520848923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38596352] [2025-02-08 04:59:54,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:54,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:54,864 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:59:54,865 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:59:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 04:59:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 04:59:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:55,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 04:59:55,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:55,492 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:59:55,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:59:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38596352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:55,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:59:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 04:59:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580781816] [2025-02-08 04:59:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:55,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:55,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:55,496 INFO L87 Difference]: Start difference. First operand 397 states and 522 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:59:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:55,620 INFO L93 Difference]: Finished difference Result 751 states and 995 transitions. [2025-02-08 04:59:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:59:55,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 166 [2025-02-08 04:59:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:55,622 INFO L225 Difference]: With dead ends: 751 [2025-02-08 04:59:55,622 INFO L226 Difference]: Without dead ends: 397 [2025-02-08 04:59:55,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:55,626 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 17 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:55,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 848 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-08 04:59:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-02-08 04:59:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.3112244897959184) internal successors, (514), 392 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 520 transitions. [2025-02-08 04:59:55,638 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 520 transitions. Word has length 166 [2025-02-08 04:59:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:55,638 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 520 transitions. [2025-02-08 04:59:55,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:59:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 520 transitions. [2025-02-08 04:59:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:59:55,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:55,640 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, 1, 1, 1, 1, 1] [2025-02-08 04:59:55,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 04:59:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:55,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 983165492, now seen corresponding path program 1 times [2025-02-08 04:59:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219095954] [2025-02-08 04:59:55,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:55,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:59:55,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:59:55,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:55,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:56,135 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:59:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219095954] [2025-02-08 04:59:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219095954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:59:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771307323] [2025-02-08 04:59:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:59:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:56,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:59:56,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:56,136 INFO L87 Difference]: Start difference. First operand 397 states and 520 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:59:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:56,331 INFO L93 Difference]: Finished difference Result 754 states and 997 transitions. [2025-02-08 04:59:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:59:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 167 [2025-02-08 04:59:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:56,333 INFO L225 Difference]: With dead ends: 754 [2025-02-08 04:59:56,333 INFO L226 Difference]: Without dead ends: 403 [2025-02-08 04:59:56,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:56,334 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 8 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:56,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1106 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-08 04:59:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-02-08 04:59:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 398 states have (on average 1.306532663316583) internal successors, (520), 398 states have internal predecessors, (520), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2025-02-08 04:59:56,347 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 167 [2025-02-08 04:59:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:56,347 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2025-02-08 04:59:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:59:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2025-02-08 04:59:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 04:59:56,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:56,349 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, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:59:56,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1216214702, now seen corresponding path program 1 times [2025-02-08 04:59:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232684152] [2025-02-08 04:59:56,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:56,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:59:56,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:59:56,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:56,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:56,620 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:59:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232684152] [2025-02-08 04:59:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232684152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:59:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416689779] [2025-02-08 04:59:56,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:56,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:59:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:56,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:59:56,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:59:56,622 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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:59:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:56,883 INFO L93 Difference]: Finished difference Result 760 states and 1001 transitions. [2025-02-08 04:59:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:59:56,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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 168 [2025-02-08 04:59:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:56,886 INFO L225 Difference]: With dead ends: 760 [2025-02-08 04:59:56,886 INFO L226 Difference]: Without dead ends: 413 [2025-02-08 04:59:56,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:59:56,887 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 12 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:56,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1586 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-08 04:59:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-02-08 04:59:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.3054187192118227) internal successors, (530), 406 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 536 transitions. [2025-02-08 04:59:56,898 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 536 transitions. Word has length 168 [2025-02-08 04:59:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:56,898 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 536 transitions. [2025-02-08 04:59:56,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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:59:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 536 transitions. [2025-02-08 04:59:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 04:59:56,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:56,901 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, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:56,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:59:56,901 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:56,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -749608814, now seen corresponding path program 1 times [2025-02-08 04:59:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901958172] [2025-02-08 04:59:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:56,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:59:57,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:59:57,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:59:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901958172] [2025-02-08 04:59:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901958172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145769017] [2025-02-08 04:59:57,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:57,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:57,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:57,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:59:57,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 04:59:57,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:59:57,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:59:57,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:57,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:57,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 04:59:57,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:57,531 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:59:57,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:59:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145769017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:57,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:59:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-02-08 04:59:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076793803] [2025-02-08 04:59:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:57,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:59:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:57,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:59:57,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:59:57,532 INFO L87 Difference]: Start difference. First operand 411 states and 536 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:59:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:57,728 INFO L93 Difference]: Finished difference Result 526 states and 690 transitions. [2025-02-08 04:59:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:59:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 168 [2025-02-08 04:59:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:57,730 INFO L225 Difference]: With dead ends: 526 [2025-02-08 04:59:57,730 INFO L226 Difference]: Without dead ends: 411 [2025-02-08 04:59:57,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:59:57,731 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 34 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:57,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1330 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-08 04:59:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-08 04:59:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.3029556650246306) internal successors, (529), 406 states have internal predecessors, (529), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 535 transitions. [2025-02-08 04:59:57,741 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 535 transitions. Word has length 168 [2025-02-08 04:59:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:57,741 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 535 transitions. [2025-02-08 04:59:57,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:59:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 535 transitions. [2025-02-08 04:59:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 04:59:57,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:57,743 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:57,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 04:59:57,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 04:59:57,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:57,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash -73656812, now seen corresponding path program 1 times [2025-02-08 04:59:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197488685] [2025-02-08 04:59:57,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:57,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 04:59:58,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 04:59:58,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:58,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:58,204 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:59:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197488685] [2025-02-08 04:59:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197488685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:59:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823545825] [2025-02-08 04:59:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:58,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:59:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:58,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:59:58,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:58,206 INFO L87 Difference]: Start difference. First operand 411 states and 535 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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:59:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:58,409 INFO L93 Difference]: Finished difference Result 529 states and 693 transitions. [2025-02-08 04:59:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:59:58,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 169 [2025-02-08 04:59:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:58,411 INFO L225 Difference]: With dead ends: 529 [2025-02-08 04:59:58,411 INFO L226 Difference]: Without dead ends: 414 [2025-02-08 04:59:58,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:58,412 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 8 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:58,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1102 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-08 04:59:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-02-08 04:59:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 409 states have (on average 1.3007334963325183) internal successors, (532), 409 states have internal predecessors, (532), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 538 transitions. [2025-02-08 04:59:58,425 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 538 transitions. Word has length 169 [2025-02-08 04:59:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 538 transitions. [2025-02-08 04:59:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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:59:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 538 transitions. [2025-02-08 04:59:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 04:59:58,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:58,427 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:58,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 04:59:58,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:58,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -461841473, now seen corresponding path program 1 times [2025-02-08 04:59:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902548554] [2025-02-08 04:59:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:58,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:59:58,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:59:58,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:58,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:59:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902548554] [2025-02-08 04:59:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902548554] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106614384] [2025-02-08 04:59:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:58,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:59:58,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 04:59:58,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:59:59,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:59:59,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:59,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:59,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 04:59:59,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:59:59,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:59:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106614384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:59:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 04:59:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107313546] [2025-02-08 04:59:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:59,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:59,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:59,071 INFO L87 Difference]: Start difference. First operand 414 states and 538 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:59,131 INFO L93 Difference]: Finished difference Result 731 states and 951 transitions. [2025-02-08 04:59:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:59:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-02-08 04:59:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:59,133 INFO L225 Difference]: With dead ends: 731 [2025-02-08 04:59:59,133 INFO L226 Difference]: Without dead ends: 417 [2025-02-08 04:59:59,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:59,134 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 0 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:59,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 971 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 04:59:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-08 04:59:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-02-08 04:59:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 411 states have (on average 1.3017031630170317) internal successors, (535), 412 states have internal predecessors, (535), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 04:59:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 542 transitions. [2025-02-08 04:59:59,146 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 542 transitions. Word has length 170 [2025-02-08 04:59:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:59,147 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 542 transitions. [2025-02-08 04:59:59,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 542 transitions. [2025-02-08 04:59:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 04:59:59,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:59,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:59,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 04:59:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 04:59:59,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:59,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2026740739, now seen corresponding path program 1 times [2025-02-08 04:59:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739617052] [2025-02-08 04:59:59,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:59,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:59:59,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:59:59,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 04:59:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739617052] [2025-02-08 04:59:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739617052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255084938] [2025-02-08 04:59:59,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:59,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:59,630 INFO L229 MonitoredProcess]: Starting monitored process 7 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:59:59,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 04:59:59,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:00:00,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:00:00,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:00,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:00,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 05:00:00,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:00:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:00:00,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:00:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:00:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255084938] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:00:00,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:00:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 05:00:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632942766] [2025-02-08 05:00:00,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:00:00,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:00:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:00,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:00:00,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:00,092 INFO L87 Difference]: Start difference. First operand 417 states and 542 transitions. Second operand has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 9 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:00:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:00,204 INFO L93 Difference]: Finished difference Result 745 states and 972 transitions. [2025-02-08 05:00:00,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:00:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 9 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 172 [2025-02-08 05:00:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:00,206 INFO L225 Difference]: With dead ends: 745 [2025-02-08 05:00:00,207 INFO L226 Difference]: Without dead ends: 428 [2025-02-08 05:00:00,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:00:00,207 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 5 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:00,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1294 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:00:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-08 05:00:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2025-02-08 05:00:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 419 states have (on average 1.3102625298329356) internal successors, (549), 420 states have internal predecessors, (549), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 556 transitions. [2025-02-08 05:00:00,218 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 556 transitions. Word has length 172 [2025-02-08 05:00:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:00,218 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 556 transitions. [2025-02-08 05:00:00,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 9 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:00:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 556 transitions. [2025-02-08 05:00:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 05:00:00,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:00,221 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:00,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 05:00:00,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 05:00:00,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:00,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash -786603265, now seen corresponding path program 2 times [2025-02-08 05:00:00,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853448827] [2025-02-08 05:00:00,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:00:00,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:00,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes. [2025-02-08 05:00:00,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 176 statements. [2025-02-08 05:00:00,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:00:00,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 05:00:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853448827] [2025-02-08 05:00:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853448827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:00:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:00:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780612031] [2025-02-08 05:00:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:00:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:00,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:00:00,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:00:00,545 INFO L87 Difference]: Start difference. First operand 426 states and 556 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 05:00:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:00,807 INFO L93 Difference]: Finished difference Result 584 states and 768 transitions. [2025-02-08 05:00:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:00:00,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 176 [2025-02-08 05:00:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:00,809 INFO L225 Difference]: With dead ends: 584 [2025-02-08 05:00:00,809 INFO L226 Difference]: Without dead ends: 466 [2025-02-08 05:00:00,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:00,810 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 79 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:00,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1431 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:00:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-02-08 05:00:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 428. [2025-02-08 05:00:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 421 states have (on average 1.3087885985748218) internal successors, (551), 422 states have internal predecessors, (551), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 558 transitions. [2025-02-08 05:00:00,821 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 558 transitions. Word has length 176 [2025-02-08 05:00:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:00,821 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 558 transitions. [2025-02-08 05:00:00,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 05:00:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 558 transitions. [2025-02-08 05:00:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-08 05:00:00,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:00,822 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:00,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:00:00,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:00,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1442626084, now seen corresponding path program 1 times [2025-02-08 05:00:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595213147] [2025-02-08 05:00:00,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:00:00,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:00:00,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:00,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:00:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595213147] [2025-02-08 05:00:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595213147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:00:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249628812] [2025-02-08 05:00:01,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:01,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:01,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:00:01,157 INFO L229 MonitoredProcess]: Starting monitored process 8 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 05:00:01,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:00:01,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:00:01,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:00:01,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:01,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:01,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 05:00:01,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:00:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:00:01,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:00:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 1 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:00:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249628812] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:00:05,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:00:05,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-02-08 05:00:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270949458] [2025-02-08 05:00:05,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:00:05,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 05:00:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:05,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 05:00:05,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=231, Unknown=1, NotChecked=0, Total=342 [2025-02-08 05:00:05,745 INFO L87 Difference]: Start difference. First operand 428 states and 558 transitions. Second operand has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:00:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:06,265 INFO L93 Difference]: Finished difference Result 763 states and 998 transitions. [2025-02-08 05:00:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 05:00:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 177 [2025-02-08 05:00:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:06,268 INFO L225 Difference]: With dead ends: 763 [2025-02-08 05:00:06,268 INFO L226 Difference]: Without dead ends: 437 [2025-02-08 05:00:06,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=267, Invalid=488, Unknown=1, NotChecked=0, Total=756 [2025-02-08 05:00:06,269 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 33 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:06,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2177 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:00:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-08 05:00:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-02-08 05:00:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 430 states have (on average 1.302325581395349) internal successors, (560), 431 states have internal predecessors, (560), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 567 transitions. [2025-02-08 05:00:06,287 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 567 transitions. Word has length 177 [2025-02-08 05:00:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 567 transitions. [2025-02-08 05:00:06,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:00:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 567 transitions. [2025-02-08 05:00:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 05:00:06,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:06,290 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:06,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 05:00:06,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:06,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:06,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:06,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1385391900, now seen corresponding path program 2 times [2025-02-08 05:00:06,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:06,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809575192] [2025-02-08 05:00:06,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:00:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:06,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 183 statements into 2 equivalence classes. [2025-02-08 05:00:06,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 183 statements. [2025-02-08 05:00:06,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:00:06,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:00:06,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809575192] [2025-02-08 05:00:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809575192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:00:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:00:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137869654] [2025-02-08 05:00:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:06,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:00:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:06,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:00:06,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:06,736 INFO L87 Difference]: Start difference. First operand 437 states and 567 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 05:00:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:07,202 INFO L93 Difference]: Finished difference Result 579 states and 752 transitions. [2025-02-08 05:00:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:00:07,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 183 [2025-02-08 05:00:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:07,204 INFO L225 Difference]: With dead ends: 579 [2025-02-08 05:00:07,204 INFO L226 Difference]: Without dead ends: 459 [2025-02-08 05:00:07,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:00:07,205 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 37 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:07,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2109 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:00:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-08 05:00:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 442. [2025-02-08 05:00:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 435 states have (on average 1.3011494252873563) internal successors, (566), 436 states have internal predecessors, (566), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 573 transitions. [2025-02-08 05:00:07,219 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 573 transitions. Word has length 183 [2025-02-08 05:00:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:07,219 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 573 transitions. [2025-02-08 05:00:07,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 05:00:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 573 transitions. [2025-02-08 05:00:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 05:00:07,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:07,220 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:07,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:00:07,221 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 91410477, now seen corresponding path program 1 times [2025-02-08 05:00:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640783984] [2025-02-08 05:00:07,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:07,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 05:00:07,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 05:00:07,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:07,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:00:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640783984] [2025-02-08 05:00:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640783984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:00:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:00:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942267708] [2025-02-08 05:00:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:07,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:00:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:07,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:00:07,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:07,589 INFO L87 Difference]: Start difference. First operand 442 states and 573 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 05:00:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:07,942 INFO L93 Difference]: Finished difference Result 577 states and 752 transitions. [2025-02-08 05:00:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:00:07,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 183 [2025-02-08 05:00:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:07,944 INFO L225 Difference]: With dead ends: 577 [2025-02-08 05:00:07,944 INFO L226 Difference]: Without dead ends: 452 [2025-02-08 05:00:07,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:07,945 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 20 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:07,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1940 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:00:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-08 05:00:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2025-02-08 05:00:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 442 states have (on average 1.3009049773755657) internal successors, (575), 443 states have internal predecessors, (575), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 582 transitions. [2025-02-08 05:00:07,959 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 582 transitions. Word has length 183 [2025-02-08 05:00:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:07,959 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 582 transitions. [2025-02-08 05:00:07,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 05:00:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 582 transitions. [2025-02-08 05:00:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-08 05:00:07,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:07,961 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:00:07,961 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1539483972, now seen corresponding path program 1 times [2025-02-08 05:00:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723985007] [2025-02-08 05:00:07,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:07,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 05:00:08,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 05:00:08,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:08,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:00:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723985007] [2025-02-08 05:00:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723985007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:00:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211304342] [2025-02-08 05:00:08,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:08,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:08,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:00:08,611 INFO L229 MonitoredProcess]: Starting monitored process 9 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 05:00:08,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:00:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 05:00:09,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 05:00:09,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:09,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:00:09,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:00:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-08 05:00:19,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:00:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211304342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:19,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:00:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-02-08 05:00:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318412718] [2025-02-08 05:00:19,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:19,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:00:19,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:19,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:00:19,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:00:19,319 INFO L87 Difference]: Start difference. First operand 449 states and 582 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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 05:00:21,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:00:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:22,544 INFO L93 Difference]: Finished difference Result 848 states and 1108 transitions. [2025-02-08 05:00:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:00:22,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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 184 [2025-02-08 05:00:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:22,546 INFO L225 Difference]: With dead ends: 848 [2025-02-08 05:00:22,546 INFO L226 Difference]: Without dead ends: 459 [2025-02-08 05:00:22,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:00:22,547 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 12 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:22,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1586 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 05:00:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-08 05:00:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 449. [2025-02-08 05:00:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 442 states have (on average 1.3009049773755657) internal successors, (575), 443 states have internal predecessors, (575), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 582 transitions. [2025-02-08 05:00:22,568 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 582 transitions. Word has length 184 [2025-02-08 05:00:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:22,569 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 582 transitions. [2025-02-08 05:00:22,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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 05:00:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 582 transitions. [2025-02-08 05:00:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 05:00:22,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:22,570 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:22,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 05:00:22,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:22,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:22,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1671642999, now seen corresponding path program 1 times [2025-02-08 05:00:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:22,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427755052] [2025-02-08 05:00:22,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:00:22,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:00:22,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:22,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-08 05:00:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427755052] [2025-02-08 05:00:23,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427755052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:23,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:00:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:00:23,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680998867] [2025-02-08 05:00:23,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:23,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:00:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:23,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:00:23,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:23,219 INFO L87 Difference]: Start difference. First operand 449 states and 582 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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 05:00:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:23,526 INFO L93 Difference]: Finished difference Result 853 states and 1112 transitions. [2025-02-08 05:00:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:00:23,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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 185 [2025-02-08 05:00:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:23,528 INFO L225 Difference]: With dead ends: 853 [2025-02-08 05:00:23,528 INFO L226 Difference]: Without dead ends: 469 [2025-02-08 05:00:23,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:00:23,530 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 20 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:23,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1675 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:00:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-08 05:00:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 463. [2025-02-08 05:00:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 456 states have (on average 1.3004385964912282) internal successors, (593), 457 states have internal predecessors, (593), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 600 transitions. [2025-02-08 05:00:23,540 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 600 transitions. Word has length 185 [2025-02-08 05:00:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 600 transitions. [2025-02-08 05:00:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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 05:00:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 600 transitions. [2025-02-08 05:00:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 05:00:23,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:23,541 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:23,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:00:23,542 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 689229879, now seen corresponding path program 1 times [2025-02-08 05:00:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098640123] [2025-02-08 05:00:23,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:23,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:00:23,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:00:23,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:23,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:00:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098640123] [2025-02-08 05:00:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098640123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:00:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764897441] [2025-02-08 05:00:24,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:24,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:00:24,346 INFO L229 MonitoredProcess]: Starting monitored process 10 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 05:00:24,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 05:00:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:00:24,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:00:24,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:24,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:24,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 05:00:24,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:00:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-08 05:00:24,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:00:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764897441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:00:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-02-08 05:00:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400750022] [2025-02-08 05:00:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:00:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:24,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:00:24,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:00:24,994 INFO L87 Difference]: Start difference. First operand 463 states and 600 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 05:00:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:25,320 INFO L93 Difference]: Finished difference Result 864 states and 1127 transitions. [2025-02-08 05:00:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:00:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 185 [2025-02-08 05:00:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:25,323 INFO L225 Difference]: With dead ends: 864 [2025-02-08 05:00:25,323 INFO L226 Difference]: Without dead ends: 473 [2025-02-08 05:00:25,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:00:25,326 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 17 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:25,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1590 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:00:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-08 05:00:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 467. [2025-02-08 05:00:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 460 states have (on average 1.2978260869565217) internal successors, (597), 461 states have internal predecessors, (597), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 604 transitions. [2025-02-08 05:00:25,366 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 604 transitions. Word has length 185 [2025-02-08 05:00:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:25,367 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 604 transitions. [2025-02-08 05:00:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 05:00:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 604 transitions. [2025-02-08 05:00:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 05:00:25,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:25,368 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:25,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 05:00:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:25,570 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1716322187, now seen corresponding path program 1 times [2025-02-08 05:00:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528881652] [2025-02-08 05:00:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:25,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:25,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:00:25,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:00:25,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-08 05:00:26,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528881652] [2025-02-08 05:00:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528881652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:00:26,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:00:26,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:00:26,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482601073] [2025-02-08 05:00:26,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:00:26,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:00:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:00:26,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:00:26,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:00:26,139 INFO L87 Difference]: Start difference. First operand 467 states and 604 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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 05:00:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:00:26,595 INFO L93 Difference]: Finished difference Result 883 states and 1151 transitions. [2025-02-08 05:00:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:00:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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 186 [2025-02-08 05:00:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:00:26,601 INFO L225 Difference]: With dead ends: 883 [2025-02-08 05:00:26,602 INFO L226 Difference]: Without dead ends: 485 [2025-02-08 05:00:26,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:00:26,603 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 26 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:00:26,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2143 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:00:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-08 05:00:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2025-02-08 05:00:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 466 states have (on average 1.293991416309013) internal successors, (603), 467 states have internal predecessors, (603), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:00:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 610 transitions. [2025-02-08 05:00:26,631 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 610 transitions. Word has length 186 [2025-02-08 05:00:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:00:26,631 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 610 transitions. [2025-02-08 05:00:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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 05:00:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 610 transitions. [2025-02-08 05:00:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 05:00:26,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:00:26,632 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:00:26,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:00:26,633 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 05:00:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:00:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2106357835, now seen corresponding path program 1 times [2025-02-08 05:00:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:00:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899717010] [2025-02-08 05:00:26,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:00:26,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:00:26,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:00:26,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:26,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:00:27,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:00:27,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899717010] [2025-02-08 05:00:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899717010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:00:27,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817097347] [2025-02-08 05:00:27,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:00:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:00:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:00:27,517 INFO L229 MonitoredProcess]: Starting monitored process 11 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 05:00:27,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:00:27,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:00:28,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:00:28,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:00:28,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:00:28,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-02-08 05:00:28,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:00:28,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:00:28,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:00:28,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 05:00:28,763 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 05:00:28,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 05:00:28,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 05:00:28,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 05:00:29,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 05:00:29,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2025-02-08 05:00:29,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 05:01:07,218 INFO L224 Elim1Store]: Index analysis took 839 ms