./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.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 0d0248500070fcb488ef1ad28c8f201e8340587643ff9baf1ad195abca806e8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:29:54,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:29:54,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:29:54,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:29:54,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:29:54,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:29:54,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:29:54,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:29:54,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:29:54,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:29:54,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:29:54,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:29:54,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:29:54,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:29:54,381 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:29:54,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:29:54,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:29:54,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:29:54,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:29:54,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:29:54,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:29:54,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:29:54,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:29:54,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:29:54,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:29:54,383 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 -> 0d0248500070fcb488ef1ad28c8f201e8340587643ff9baf1ad195abca806e8b [2025-02-06 03:29:54,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:29:54,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:29:54,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:29:54,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:29:54,650 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:29:54,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i [2025-02-06 03:29:55,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45e5a8763/1194096f918b4c0484d5e16ece80bac0/FLAGd69a32227 [2025-02-06 03:29:56,173 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:29:56,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i [2025-02-06 03:29:56,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45e5a8763/1194096f918b4c0484d5e16ece80bac0/FLAGd69a32227 [2025-02-06 03:29:56,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45e5a8763/1194096f918b4c0484d5e16ece80bac0 [2025-02-06 03:29:56,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:29:56,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:29:56,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:29:56,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:29:56,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:29:56,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5513b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56, skipping insertion in model container [2025-02-06 03:29:56,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:29:56,373 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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i[917,930] [2025-02-06 03:29:56,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:29:56,439 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:29:56,450 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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i[917,930] [2025-02-06 03:29:56,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:29:56,490 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:29:56,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56 WrapperNode [2025-02-06 03:29:56,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:29:56,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:29:56,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:29:56,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:29:56,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,535 INFO L138 Inliner]: procedures = 26, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 359 [2025-02-06 03:29:56,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:29:56,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:29:56,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:29:56,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:29:56,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,564 INFO L175 MemorySlicer]: Split 96 memory accesses to 5 slices as follows [2, 12, 32, 24, 26]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 4, 3, 3]. The 16 writes are split as follows [0, 2, 6, 4, 4]. [2025-02-06 03:29:56,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:29:56,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:29:56,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:29:56,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:29:56,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (1/1) ... [2025-02-06 03:29:56,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:29:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:29:56,615 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-06 03:29:56,619 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-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:29:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:29:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:29:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:29:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:29:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:29:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:29:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:29:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:29:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:29:56,767 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:29:56,769 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:29:57,109 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem55#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~ite65#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite78#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem72#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~short79#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~ite88#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1; [2025-02-06 03:29:57,155 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-02-06 03:29:57,155 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:29:57,164 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:29:57,164 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:29:57,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:29:57 BoogieIcfgContainer [2025-02-06 03:29:57,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:29:57,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:29:57,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:29:57,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:29:57,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:29:56" (1/3) ... [2025-02-06 03:29:57,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7b0b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:29:57, skipping insertion in model container [2025-02-06 03:29:57,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:29:56" (2/3) ... [2025-02-06 03:29:57,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7b0b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:29:57, skipping insertion in model container [2025-02-06 03:29:57,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:29:57" (3/3) ... [2025-02-06 03:29:57,173 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-59.i [2025-02-06 03:29:57,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:29:57,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-59.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:29:57,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:29:57,248 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;@2f647b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:29:57,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:29:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:29:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:29:57,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:29:57,266 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:29:57,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:29:57,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:29:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1339569664, now seen corresponding path program 1 times [2025-02-06 03:29:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:29:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531860495] [2025-02-06 03:29:57,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:29:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:29:57,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:29:57,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:29:57,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:29:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:29:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:29:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:29:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531860495] [2025-02-06 03:29:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531860495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:29:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956112681] [2025-02-06 03:29:57,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:29:57,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:29:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:29:57,596 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-06 03:29:57,613 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-06 03:29:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:29:57,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:29:57,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:29:57,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:29:57,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:29:57,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:29:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:29:57,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:29:57,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956112681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:29:57,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:29:57,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:29:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000652967] [2025-02-06 03:29:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:29:57,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:29:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:29:57,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:29:57,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:29:57,889 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:29:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:29:57,913 INFO L93 Difference]: Finished difference Result 160 states and 253 transitions. [2025-02-06 03:29:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:29:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2025-02-06 03:29:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:29:57,919 INFO L225 Difference]: With dead ends: 160 [2025-02-06 03:29:57,920 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 03:29:57,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-06 03:29:57,927 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:29:57,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:29:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 03:29:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 03:29:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:29:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-02-06 03:29:57,962 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 131 [2025-02-06 03:29:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:29:57,962 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-02-06 03:29:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:29:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-02-06 03:29:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:29:57,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:29:57,968 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:29:57,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:29:58,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:29:58,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:29:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:29:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 594855918, now seen corresponding path program 1 times [2025-02-06 03:29:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:29:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722595958] [2025-02-06 03:29:58,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:29:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:29:58,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:29:58,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:29:58,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:29:58,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:29:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:29:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:29:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722595958] [2025-02-06 03:29:58,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722595958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:29:58,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:29:58,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:29:58,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687731919] [2025-02-06 03:29:58,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:29:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:29:58,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:29:58,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:29:58,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:29:58,671 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:29:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:29:58,854 INFO L93 Difference]: Finished difference Result 216 states and 310 transitions. [2025-02-06 03:29:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:29:58,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-02-06 03:29:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:29:58,859 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:29:58,861 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 03:29:58,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 03:29:58,862 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 81 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:29:58,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 307 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:29:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 03:29:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-02-06 03:29:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.297029702970297) internal successors, (131), 102 states have internal predecessors, (131), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:29:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 195 transitions. [2025-02-06 03:29:58,885 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 195 transitions. Word has length 131 [2025-02-06 03:29:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:29:58,886 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 195 transitions. [2025-02-06 03:29:58,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:29:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 195 transitions. [2025-02-06 03:29:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:29:58,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:29:58,888 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:29:58,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:29:58,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:29:58,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:29:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash 398342413, now seen corresponding path program 1 times [2025-02-06 03:29:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:29:58,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108753194] [2025-02-06 03:29:58,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:29:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:29:58,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:29:58,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:29:58,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:29:58,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:29:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:29:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:29:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108753194] [2025-02-06 03:29:59,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108753194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:29:59,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:29:59,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:29:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382484640] [2025-02-06 03:29:59,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:29:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:29:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:29:59,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:29:59,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:29:59,291 INFO L87 Difference]: Start difference. First operand 136 states and 195 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:29:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:29:59,577 INFO L93 Difference]: Finished difference Result 375 states and 538 transitions. [2025-02-06 03:29:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:29:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 131 [2025-02-06 03:29:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:29:59,581 INFO L225 Difference]: With dead ends: 375 [2025-02-06 03:29:59,582 INFO L226 Difference]: Without dead ends: 242 [2025-02-06 03:29:59,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:29:59,583 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 139 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:29:59,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 348 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:29:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-06 03:29:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2025-02-06 03:29:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 170 states have internal predecessors, (221), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:29:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 321 transitions. [2025-02-06 03:29:59,611 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 321 transitions. Word has length 131 [2025-02-06 03:29:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:29:59,612 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 321 transitions. [2025-02-06 03:29:59,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:29:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 321 transitions. [2025-02-06 03:29:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:29:59,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:29:59,614 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:29:59,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:29:59,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:29:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:29:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1556609901, now seen corresponding path program 1 times [2025-02-06 03:29:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:29:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389442682] [2025-02-06 03:29:59,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:29:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:29:59,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:29:59,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:29:59,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:29:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:00,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389442682] [2025-02-06 03:30:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389442682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:30:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574733426] [2025-02-06 03:30:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:00,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:30:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:30:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:00,584 INFO L87 Difference]: Start difference. First operand 224 states and 321 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:00,926 INFO L93 Difference]: Finished difference Result 481 states and 688 transitions. [2025-02-06 03:30:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-02-06 03:30:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:00,930 INFO L225 Difference]: With dead ends: 481 [2025-02-06 03:30:00,931 INFO L226 Difference]: Without dead ends: 336 [2025-02-06 03:30:00,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:30:00,932 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 247 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:00,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 364 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-06 03:30:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2025-02-06 03:30:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 270 states have internal predecessors, (355), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 471 transitions. [2025-02-06 03:30:01,008 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 471 transitions. Word has length 133 [2025-02-06 03:30:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:01,011 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 471 transitions. [2025-02-06 03:30:01,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 471 transitions. [2025-02-06 03:30:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:30:01,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:01,017 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:30:01,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 930902932, now seen corresponding path program 1 times [2025-02-06 03:30:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665994654] [2025-02-06 03:30:01,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:01,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:30:01,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:30:01,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:01,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:01,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665994654] [2025-02-06 03:30:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665994654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:01,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:30:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024451212] [2025-02-06 03:30:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:01,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:30:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:01,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:30:01,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:01,199 INFO L87 Difference]: Start difference. First operand 332 states and 471 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:01,385 INFO L93 Difference]: Finished difference Result 692 states and 989 transitions. [2025-02-06 03:30:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:01,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-02-06 03:30:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:01,388 INFO L225 Difference]: With dead ends: 692 [2025-02-06 03:30:01,388 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 03:30:01,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:01,392 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 129 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:01,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 358 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:30:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 03:30:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 351. [2025-02-06 03:30:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 286 states have (on average 1.3216783216783217) internal successors, (378), 289 states have internal predecessors, (378), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 494 transitions. [2025-02-06 03:30:01,441 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 494 transitions. Word has length 133 [2025-02-06 03:30:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:01,441 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 494 transitions. [2025-02-06 03:30:01,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 494 transitions. [2025-02-06 03:30:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:30:01,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:01,444 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:01,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:30:01,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1427527182, now seen corresponding path program 1 times [2025-02-06 03:30:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060806867] [2025-02-06 03:30:01,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:01,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:30:01,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:30:01,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:01,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:01,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:01,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060806867] [2025-02-06 03:30:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060806867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:30:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016226011] [2025-02-06 03:30:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:01,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:30:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:01,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:30:01,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:01,625 INFO L87 Difference]: Start difference. First operand 351 states and 494 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:01,820 INFO L93 Difference]: Finished difference Result 646 states and 910 transitions. [2025-02-06 03:30:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-02-06 03:30:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:01,824 INFO L225 Difference]: With dead ends: 646 [2025-02-06 03:30:01,824 INFO L226 Difference]: Without dead ends: 405 [2025-02-06 03:30:01,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:01,825 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 97 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:01,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 454 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:30:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-06 03:30:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 333. [2025-02-06 03:30:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 271 states have internal predecessors, (352), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 468 transitions. [2025-02-06 03:30:01,873 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 468 transitions. Word has length 133 [2025-02-06 03:30:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:01,874 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 468 transitions. [2025-02-06 03:30:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 468 transitions. [2025-02-06 03:30:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:30:01,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:01,876 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:30:01,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1420819444, now seen corresponding path program 1 times [2025-02-06 03:30:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:01,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277934711] [2025-02-06 03:30:01,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:01,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:30:01,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:30:01,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:01,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277934711] [2025-02-06 03:30:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277934711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:30:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772716794] [2025-02-06 03:30:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:02,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:30:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:30:02,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:30:02,035 INFO L87 Difference]: Start difference. First operand 333 states and 468 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:02,142 INFO L93 Difference]: Finished difference Result 569 states and 801 transitions. [2025-02-06 03:30:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-02-06 03:30:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:02,145 INFO L225 Difference]: With dead ends: 569 [2025-02-06 03:30:02,147 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 03:30:02,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:02,148 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 36 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:02,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 478 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:30:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 03:30:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330. [2025-02-06 03:30:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 265 states have (on average 1.3094339622641509) internal successors, (347), 268 states have internal predecessors, (347), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 463 transitions. [2025-02-06 03:30:02,184 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 463 transitions. Word has length 133 [2025-02-06 03:30:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 463 transitions. [2025-02-06 03:30:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 463 transitions. [2025-02-06 03:30:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:30:02,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:02,189 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:02,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:30:02,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:02,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash -937610670, now seen corresponding path program 1 times [2025-02-06 03:30:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:02,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438362575] [2025-02-06 03:30:02,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:02,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:30:02,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:30:02,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:02,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438362575] [2025-02-06 03:30:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438362575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:30:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081942237] [2025-02-06 03:30:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:02,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:30:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:02,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:30:02,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:30:02,375 INFO L87 Difference]: Start difference. First operand 330 states and 463 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:02,485 INFO L93 Difference]: Finished difference Result 568 states and 799 transitions. [2025-02-06 03:30:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-02-06 03:30:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:02,488 INFO L225 Difference]: With dead ends: 568 [2025-02-06 03:30:02,488 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 03:30:02,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 03:30:02,490 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 33 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:02,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 417 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:30:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 03:30:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-02-06 03:30:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 266 states have (on average 1.3045112781954886) internal successors, (347), 269 states have internal predecessors, (347), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2025-02-06 03:30:02,541 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 133 [2025-02-06 03:30:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:02,542 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2025-02-06 03:30:02,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2025-02-06 03:30:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:30:02,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:02,545 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:02,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:30:02,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1549902163, now seen corresponding path program 1 times [2025-02-06 03:30:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040278162] [2025-02-06 03:30:02,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:02,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:30:02,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:30:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040278162] [2025-02-06 03:30:02,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040278162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:02,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:02,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:30:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242391814] [2025-02-06 03:30:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:02,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:30:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:02,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:30:02,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:02,959 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:30:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:03,216 INFO L93 Difference]: Finished difference Result 573 states and 798 transitions. [2025-02-06 03:30:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:03,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-02-06 03:30:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:03,220 INFO L225 Difference]: With dead ends: 573 [2025-02-06 03:30:03,220 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 03:30:03,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:03,223 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 113 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:03,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 410 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 03:30:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 315. [2025-02-06 03:30:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.292) internal successors, (323), 253 states have internal predecessors, (323), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 439 transitions. [2025-02-06 03:30:03,279 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 439 transitions. Word has length 133 [2025-02-06 03:30:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 439 transitions. [2025-02-06 03:30:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:30:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 439 transitions. [2025-02-06 03:30:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:30:03,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:03,281 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:03,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:30:03,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 316662733, now seen corresponding path program 1 times [2025-02-06 03:30:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035991973] [2025-02-06 03:30:03,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:03,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:30:03,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:30:03,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:03,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035991973] [2025-02-06 03:30:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035991973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:30:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009137468] [2025-02-06 03:30:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:03,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:30:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:03,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:30:03,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:03,773 INFO L87 Difference]: Start difference. First operand 315 states and 439 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:04,016 INFO L93 Difference]: Finished difference Result 757 states and 1051 transitions. [2025-02-06 03:30:04,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:30:04,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2025-02-06 03:30:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:04,020 INFO L225 Difference]: With dead ends: 757 [2025-02-06 03:30:04,021 INFO L226 Difference]: Without dead ends: 533 [2025-02-06 03:30:04,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:30:04,022 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 143 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:04,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 545 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-06 03:30:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 383. [2025-02-06 03:30:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 318 states have (on average 1.2955974842767295) internal successors, (412), 321 states have internal predecessors, (412), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 528 transitions. [2025-02-06 03:30:04,060 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 528 transitions. Word has length 135 [2025-02-06 03:30:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:04,060 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 528 transitions. [2025-02-06 03:30:04,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 528 transitions. [2025-02-06 03:30:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:30:04,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:04,061 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:04,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:30:04,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:04,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -62653148, now seen corresponding path program 1 times [2025-02-06 03:30:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:04,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141440546] [2025-02-06 03:30:04,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:04,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:30:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:30:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:30:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310541882] [2025-02-06 03:30:04,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:04,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:04,153 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-06 03:30:04,156 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-06 03:30:04,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:30:04,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:30:04,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:04,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:04,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:30:04,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:04,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:30:06,391 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 15 treesize of output 1 [2025-02-06 03:30:07,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:07,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:07,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:07,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 03:30:07,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:07,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:30:07,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:30:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 03:30:07,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:30:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141440546] [2025-02-06 03:30:12,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:30:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310541882] [2025-02-06 03:30:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310541882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:12,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-06 03:30:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524249914] [2025-02-06 03:30:12,340 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:30:12,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:30:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:12,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:30:12,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2025-02-06 03:30:12,341 INFO L87 Difference]: Start difference. First operand 383 states and 528 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:13,151 INFO L93 Difference]: Finished difference Result 721 states and 991 transitions. [2025-02-06 03:30:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:30:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-02-06 03:30:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:13,154 INFO L225 Difference]: With dead ends: 721 [2025-02-06 03:30:13,154 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 03:30:13,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2025-02-06 03:30:13,155 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:13,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 543 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:30:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 03:30:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 383. [2025-02-06 03:30:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 321 states have internal predecessors, (410), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2025-02-06 03:30:13,189 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 136 [2025-02-06 03:30:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2025-02-06 03:30:13,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2025-02-06 03:30:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:30:13,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:13,191 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:13,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:30:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:13,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:13,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1628177647, now seen corresponding path program 1 times [2025-02-06 03:30:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104206776] [2025-02-06 03:30:13,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:13,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:30:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:30:13,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:30:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175060958] [2025-02-06 03:30:13,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:13,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:13,489 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-06 03:30:13,491 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-06 03:30:13,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:30:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:30:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:13,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 03:30:13,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:14,927 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 15 treesize of output 1 [2025-02-06 03:30:15,145 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 15 treesize of output 1 [2025-02-06 03:30:15,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2025-02-06 03:30:15,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:30:15,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 03:30:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 03:30:15,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:30:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:20,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104206776] [2025-02-06 03:30:20,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:30:20,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175060958] [2025-02-06 03:30:20,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175060958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:20,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:20,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-06 03:30:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627875183] [2025-02-06 03:30:20,329 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:30:20,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:30:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:20,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:30:20,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2025-02-06 03:30:20,330 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:20,898 INFO L93 Difference]: Finished difference Result 719 states and 984 transitions. [2025-02-06 03:30:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:30:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-02-06 03:30:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:20,902 INFO L225 Difference]: With dead ends: 719 [2025-02-06 03:30:20,902 INFO L226 Difference]: Without dead ends: 431 [2025-02-06 03:30:20,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2025-02-06 03:30:20,903 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 185 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:20,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 496 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:30:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-06 03:30:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 387. [2025-02-06 03:30:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 321 states have (on average 1.280373831775701) internal successors, (411), 324 states have internal predecessors, (411), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 527 transitions. [2025-02-06 03:30:20,950 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 527 transitions. Word has length 137 [2025-02-06 03:30:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:20,951 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 527 transitions. [2025-02-06 03:30:20,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:30:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 527 transitions. [2025-02-06 03:30:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:30:20,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:20,957 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:20,966 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-06 03:30:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:21,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2117131130, now seen corresponding path program 1 times [2025-02-06 03:30:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723536310] [2025-02-06 03:30:21,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:21,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:30:21,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:30:21,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:21,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723536310] [2025-02-06 03:30:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723536310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:22,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:30:22,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264630629] [2025-02-06 03:30:22,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:22,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:30:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:22,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:30:22,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:22,482 INFO L87 Difference]: Start difference. First operand 387 states and 527 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:22,975 INFO L93 Difference]: Finished difference Result 881 states and 1206 transitions. [2025-02-06 03:30:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:30:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-02-06 03:30:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:22,981 INFO L225 Difference]: With dead ends: 881 [2025-02-06 03:30:22,981 INFO L226 Difference]: Without dead ends: 611 [2025-02-06 03:30:22,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:30:22,984 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 122 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:22,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 748 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-06 03:30:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 451. [2025-02-06 03:30:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 385 states have (on average 1.2935064935064935) internal successors, (498), 388 states have internal predecessors, (498), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 614 transitions. [2025-02-06 03:30:23,030 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 614 transitions. Word has length 138 [2025-02-06 03:30:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:23,031 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 614 transitions. [2025-02-06 03:30:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 614 transitions. [2025-02-06 03:30:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:30:23,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:23,032 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:23,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:30:23,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:23,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 370381703, now seen corresponding path program 1 times [2025-02-06 03:30:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531733425] [2025-02-06 03:30:23,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:23,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:30:23,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:30:23,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:23,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:23,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531733425] [2025-02-06 03:30:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531733425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:23,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:30:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789417001] [2025-02-06 03:30:23,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:23,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:30:23,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:23,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:30:23,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:23,387 INFO L87 Difference]: Start difference. First operand 451 states and 614 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:23,623 INFO L93 Difference]: Finished difference Result 833 states and 1145 transitions. [2025-02-06 03:30:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:23,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-02-06 03:30:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:23,626 INFO L225 Difference]: With dead ends: 833 [2025-02-06 03:30:23,626 INFO L226 Difference]: Without dead ends: 503 [2025-02-06 03:30:23,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:30:23,627 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:23,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 371 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-06 03:30:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 451. [2025-02-06 03:30:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 385 states have (on average 1.283116883116883) internal successors, (494), 388 states have internal predecessors, (494), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 610 transitions. [2025-02-06 03:30:23,672 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 610 transitions. Word has length 138 [2025-02-06 03:30:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:23,672 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 610 transitions. [2025-02-06 03:30:23,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 610 transitions. [2025-02-06 03:30:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:30:23,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:23,675 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:23,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:30:23,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1333364295, now seen corresponding path program 1 times [2025-02-06 03:30:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361692210] [2025-02-06 03:30:23,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:23,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:30:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:30:23,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361692210] [2025-02-06 03:30:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361692210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:24,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:30:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584657715] [2025-02-06 03:30:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:24,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:30:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:24,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:30:24,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:24,003 INFO L87 Difference]: Start difference. First operand 451 states and 610 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:24,272 INFO L93 Difference]: Finished difference Result 825 states and 1133 transitions. [2025-02-06 03:30:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:24,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-02-06 03:30:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:24,276 INFO L225 Difference]: With dead ends: 825 [2025-02-06 03:30:24,276 INFO L226 Difference]: Without dead ends: 495 [2025-02-06 03:30:24,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:24,279 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 109 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:24,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 409 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-06 03:30:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 453. [2025-02-06 03:30:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 387 states have (on average 1.2713178294573644) internal successors, (492), 390 states have internal predecessors, (492), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:30:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 608 transitions. [2025-02-06 03:30:24,324 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 608 transitions. Word has length 138 [2025-02-06 03:30:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:24,325 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 608 transitions. [2025-02-06 03:30:24,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 608 transitions. [2025-02-06 03:30:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:30:24,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:24,326 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:24,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:30:24,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -474090168, now seen corresponding path program 1 times [2025-02-06 03:30:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877825624] [2025-02-06 03:30:24,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:24,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:30:24,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:30:24,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877825624] [2025-02-06 03:30:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877825624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:24,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:30:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300713439] [2025-02-06 03:30:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:30:24,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:24,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:30:24,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:24,682 INFO L87 Difference]: Start difference. First operand 453 states and 608 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:25,004 INFO L93 Difference]: Finished difference Result 857 states and 1159 transitions. [2025-02-06 03:30:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:30:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-02-06 03:30:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:25,008 INFO L225 Difference]: With dead ends: 857 [2025-02-06 03:30:25,008 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 03:30:25,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:30:25,012 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:25,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 782 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:30:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 03:30:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2025-02-06 03:30:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 331 states have (on average 1.2628398791540785) internal successors, (418), 332 states have internal predecessors, (418), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:30:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 518 transitions. [2025-02-06 03:30:25,069 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 518 transitions. Word has length 138 [2025-02-06 03:30:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:25,069 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 518 transitions. [2025-02-06 03:30:25,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 518 transitions. [2025-02-06 03:30:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:30:25,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:25,071 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:25,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:30:25,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:25,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1857703683, now seen corresponding path program 1 times [2025-02-06 03:30:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089192704] [2025-02-06 03:30:25,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:25,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:30:25,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:30:25,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:30:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089192704] [2025-02-06 03:30:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089192704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166359170] [2025-02-06 03:30:25,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:25,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:25,269 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-06 03:30:25,270 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-06 03:30:25,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:30:25,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:30:25,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:25,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:25,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:30:25,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:25,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:30:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166359170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-02-06 03:30:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026716407] [2025-02-06 03:30:25,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:25,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:30:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:25,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:30:25,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:30:25,489 INFO L87 Difference]: Start difference. First operand 389 states and 518 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:25,553 INFO L93 Difference]: Finished difference Result 401 states and 531 transitions. [2025-02-06 03:30:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:30:25,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-02-06 03:30:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:25,556 INFO L225 Difference]: With dead ends: 401 [2025-02-06 03:30:25,556 INFO L226 Difference]: Without dead ends: 399 [2025-02-06 03:30:25,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:30:25,557 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:25,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 648 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-06 03:30:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-02-06 03:30:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 341 states have (on average 1.2551319648093842) internal successors, (428), 342 states have internal predecessors, (428), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:30:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 528 transitions. [2025-02-06 03:30:25,600 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 528 transitions. Word has length 140 [2025-02-06 03:30:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:25,600 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 528 transitions. [2025-02-06 03:30:25,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 528 transitions. [2025-02-06 03:30:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:30:25,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:25,602 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:30:25,611 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-06 03:30:25,802 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,SelfDestructingSolverStorable16 [2025-02-06 03:30:25,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:25,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 425098242, now seen corresponding path program 1 times [2025-02-06 03:30:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751679442] [2025-02-06 03:30:25,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:25,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:25,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:30:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:30:25,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:25,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:30:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751679442] [2025-02-06 03:30:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751679442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718507592] [2025-02-06 03:30:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:26,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:26,014 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-06 03:30:26,016 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-06 03:30:26,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:30:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:30:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:26,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:30:26,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:30:26,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:30:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718507592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:26,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:26,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-02-06 03:30:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194612291] [2025-02-06 03:30:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:26,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:30:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:26,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:30:26,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:30:26,262 INFO L87 Difference]: Start difference. First operand 399 states and 528 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:26,336 INFO L93 Difference]: Finished difference Result 413 states and 543 transitions. [2025-02-06 03:30:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:30:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-02-06 03:30:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:26,339 INFO L225 Difference]: With dead ends: 413 [2025-02-06 03:30:26,339 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 03:30:26,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:30:26,340 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:26,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 749 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 03:30:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 401. [2025-02-06 03:30:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 343 states have (on average 1.2536443148688046) internal successors, (430), 344 states have internal predecessors, (430), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:30:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 530 transitions. [2025-02-06 03:30:26,376 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 530 transitions. Word has length 142 [2025-02-06 03:30:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:26,376 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 530 transitions. [2025-02-06 03:30:26,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 530 transitions. [2025-02-06 03:30:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-06 03:30:26,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:26,380 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:26,389 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-06 03:30:26,584 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,SelfDestructingSolverStorable17 [2025-02-06 03:30:26,584 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:26,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1500482886, now seen corresponding path program 1 times [2025-02-06 03:30:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775624645] [2025-02-06 03:30:26,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:26,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 03:30:26,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 03:30:26,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:26,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 2548 trivial. 0 not checked. [2025-02-06 03:30:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775624645] [2025-02-06 03:30:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775624645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596792671] [2025-02-06 03:30:27,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:27,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:27,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:27,466 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-06 03:30:27,468 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-06 03:30:27,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 03:30:27,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 03:30:27,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:27,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:27,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:30:27,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:29,563 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 15 treesize of output 1 [2025-02-06 03:30:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:29,736 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2025-02-06 03:30:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 5 proven. 744 refuted. 0 times theorem prover too weak. 1826 trivial. 0 not checked. [2025-02-06 03:30:29,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:30:29,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-06 03:30:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596792671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:29,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:30:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2025-02-06 03:30:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707055090] [2025-02-06 03:30:29,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:30:29,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:30:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:29,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:30:29,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:30:29,859 INFO L87 Difference]: Start difference. First operand 401 states and 530 transitions. Second operand has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-02-06 03:30:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:30,228 INFO L93 Difference]: Finished difference Result 829 states and 1109 transitions. [2025-02-06 03:30:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:30,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 268 [2025-02-06 03:30:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:30,232 INFO L225 Difference]: With dead ends: 829 [2025-02-06 03:30:30,232 INFO L226 Difference]: Without dead ends: 557 [2025-02-06 03:30:30,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:30:30,233 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 164 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:30,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 516 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:30:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-06 03:30:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2025-02-06 03:30:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 467 states have (on average 1.2419700214132763) internal successors, (580), 470 states have internal predecessors, (580), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:30:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 728 transitions. [2025-02-06 03:30:30,287 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 728 transitions. Word has length 268 [2025-02-06 03:30:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:30,288 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 728 transitions. [2025-02-06 03:30:30,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-02-06 03:30:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 728 transitions. [2025-02-06 03:30:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-06 03:30:30,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:30,291 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:30,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:30:30,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:30,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:30,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1183543452, now seen corresponding path program 1 times [2025-02-06 03:30:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:30,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571537229] [2025-02-06 03:30:30,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:30,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 03:30:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 03:30:30,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:30,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2564 trivial. 0 not checked. [2025-02-06 03:30:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571537229] [2025-02-06 03:30:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571537229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:30,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:30:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615845877] [2025-02-06 03:30:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:30:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:30:30,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:30,729 INFO L87 Difference]: Start difference. First operand 553 states and 728 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:30,886 INFO L93 Difference]: Finished difference Result 973 states and 1290 transitions. [2025-02-06 03:30:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 268 [2025-02-06 03:30:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:30,889 INFO L225 Difference]: With dead ends: 973 [2025-02-06 03:30:30,890 INFO L226 Difference]: Without dead ends: 546 [2025-02-06 03:30:30,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:30:30,891 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 31 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:30,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 591 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:30:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-06 03:30:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 541. [2025-02-06 03:30:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 455 states have (on average 1.2285714285714286) internal successors, (559), 458 states have internal predecessors, (559), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:30:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 707 transitions. [2025-02-06 03:30:30,944 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 707 transitions. Word has length 268 [2025-02-06 03:30:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:30,944 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 707 transitions. [2025-02-06 03:30:30,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 707 transitions. [2025-02-06 03:30:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 03:30:30,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:30,946 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:30,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:30:30,946 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:30,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1124847411, now seen corresponding path program 1 times [2025-02-06 03:30:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513891495] [2025-02-06 03:30:30,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:30,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 03:30:30,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 03:30:30,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2566 trivial. 0 not checked. [2025-02-06 03:30:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513891495] [2025-02-06 03:30:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513891495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:31,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:30:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416048898] [2025-02-06 03:30:31,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:30:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:31,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:30:31,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:30:31,108 INFO L87 Difference]: Start difference. First operand 541 states and 707 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:31,208 INFO L93 Difference]: Finished difference Result 1040 states and 1360 transitions. [2025-02-06 03:30:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:30:31,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 270 [2025-02-06 03:30:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:31,212 INFO L225 Difference]: With dead ends: 1040 [2025-02-06 03:30:31,212 INFO L226 Difference]: Without dead ends: 628 [2025-02-06 03:30:31,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:31,214 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:31,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 450 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-02-06 03:30:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 526. [2025-02-06 03:30:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 440 states have (on average 1.2227272727272727) internal successors, (538), 443 states have internal predecessors, (538), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:30:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 686 transitions. [2025-02-06 03:30:31,266 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 686 transitions. Word has length 270 [2025-02-06 03:30:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 686 transitions. [2025-02-06 03:30:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 686 transitions. [2025-02-06 03:30:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 03:30:31,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:31,270 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:30:31,271 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:31,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 811689771, now seen corresponding path program 1 times [2025-02-06 03:30:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426681656] [2025-02-06 03:30:31,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:31,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 03:30:31,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 03:30:31,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:31,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2566 trivial. 0 not checked. [2025-02-06 03:30:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426681656] [2025-02-06 03:30:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426681656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:31,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:30:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007329256] [2025-02-06 03:30:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:30:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:31,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:30:31,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:30:31,427 INFO L87 Difference]: Start difference. First operand 526 states and 686 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:31,515 INFO L93 Difference]: Finished difference Result 919 states and 1206 transitions. [2025-02-06 03:30:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:30:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 270 [2025-02-06 03:30:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:31,520 INFO L225 Difference]: With dead ends: 919 [2025-02-06 03:30:31,521 INFO L226 Difference]: Without dead ends: 522 [2025-02-06 03:30:31,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 03:30:31,523 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:31,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 409 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:30:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-06 03:30:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2025-02-06 03:30:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 434 states have (on average 1.2096774193548387) internal successors, (525), 437 states have internal predecessors, (525), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:30:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 673 transitions. [2025-02-06 03:30:31,574 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 673 transitions. Word has length 270 [2025-02-06 03:30:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 673 transitions. [2025-02-06 03:30:31,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 673 transitions. [2025-02-06 03:30:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 03:30:31,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:31,576 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:31,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:30:31,577 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:31,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash -831444404, now seen corresponding path program 1 times [2025-02-06 03:30:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588929701] [2025-02-06 03:30:31,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:31,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 03:30:31,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 03:30:31,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:31,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2025-02-06 03:30:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588929701] [2025-02-06 03:30:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588929701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:30:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:30:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:30:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979876864] [2025-02-06 03:30:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:30:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:30:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:31,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:30:31,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:30:31,808 INFO L87 Difference]: Start difference. First operand 520 states and 673 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:31,956 INFO L93 Difference]: Finished difference Result 1001 states and 1294 transitions. [2025-02-06 03:30:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:30:31,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 270 [2025-02-06 03:30:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:31,960 INFO L225 Difference]: With dead ends: 1001 [2025-02-06 03:30:31,960 INFO L226 Difference]: Without dead ends: 610 [2025-02-06 03:30:31,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:30:31,962 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 43 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:31,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 606 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:30:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-06 03:30:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 505. [2025-02-06 03:30:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 419 states have (on average 1.1957040572792363) internal successors, (501), 422 states have internal predecessors, (501), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:30:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 649 transitions. [2025-02-06 03:30:32,013 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 649 transitions. Word has length 270 [2025-02-06 03:30:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:32,014 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 649 transitions. [2025-02-06 03:30:32,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:30:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 649 transitions. [2025-02-06 03:30:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 03:30:32,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:32,016 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:30:32,016 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 861448273, now seen corresponding path program 1 times [2025-02-06 03:30:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289706273] [2025-02-06 03:30:32,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 03:30:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 03:30:32,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:32,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:30:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065689409] [2025-02-06 03:30:32,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:32,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:32,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:32,146 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-06 03:30:32,148 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-06 03:30:32,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 03:30:32,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 03:30:32,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:32,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:32,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-06 03:30:32,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:34,418 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 15 treesize of output 1 [2025-02-06 03:30:34,799 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 03:30:35,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 03:30:35,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:30:35,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:30:36,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 03:30:36,586 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 15 treesize of output 1 [2025-02-06 03:30:36,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:30:36,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 03:30:37,827 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 15 treesize of output 1 [2025-02-06 03:30:38,006 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 15 treesize of output 1 [2025-02-06 03:30:38,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:38,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:30:38,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-02-06 03:30:38,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:30:38,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 03:30:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 6 proven. 1923 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:30:38,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:30:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:38,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289706273] [2025-02-06 03:30:38,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:30:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065689409] [2025-02-06 03:30:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065689409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:38,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-06 03:30:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265796138] [2025-02-06 03:30:38,911 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:30:38,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:30:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:38,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:30:38,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:30:38,912 INFO L87 Difference]: Start difference. First operand 505 states and 649 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 10 states have internal predecessors, (103), 4 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 03:30:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:40,263 INFO L93 Difference]: Finished difference Result 1752 states and 2244 transitions. [2025-02-06 03:30:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:30:40,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 10 states have internal predecessors, (103), 4 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 271 [2025-02-06 03:30:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:40,270 INFO L225 Difference]: With dead ends: 1752 [2025-02-06 03:30:40,270 INFO L226 Difference]: Without dead ends: 1376 [2025-02-06 03:30:40,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:30:40,271 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 476 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:40,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 613 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:30:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-02-06 03:30:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1130. [2025-02-06 03:30:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 939 states have (on average 1.1863684771033014) internal successors, (1114), 949 states have internal predecessors, (1114), 162 states have call successors, (162), 28 states have call predecessors, (162), 28 states have return successors, (162), 152 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-06 03:30:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1438 transitions. [2025-02-06 03:30:40,406 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1438 transitions. Word has length 271 [2025-02-06 03:30:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:40,406 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1438 transitions. [2025-02-06 03:30:40,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 10 states have internal predecessors, (103), 4 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 03:30:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1438 transitions. [2025-02-06 03:30:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-06 03:30:40,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:40,409 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 03:30:40,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:30:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:40,615 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 210550626, now seen corresponding path program 1 times [2025-02-06 03:30:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458860298] [2025-02-06 03:30:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:40,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-06 03:30:40,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 03:30:40,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:40,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:30:40,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772049693] [2025-02-06 03:30:40,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:40,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:40,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:30:40,786 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-06 03:30:40,788 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-06 03:30:40,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-06 03:30:41,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 03:30:41,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:41,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:30:41,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 03:30:41,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:30:42,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:30:42,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:30:44,023 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 15 treesize of output 1 [2025-02-06 03:30:44,174 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 15 treesize of output 1 [2025-02-06 03:30:44,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-02-06 03:30:44,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:30:44,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 03:30:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 6 proven. 1634 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-02-06 03:30:44,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:30:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:30:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458860298] [2025-02-06 03:30:46,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:30:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772049693] [2025-02-06 03:30:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772049693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:30:46,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:30:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-06 03:30:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412736683] [2025-02-06 03:30:46,321 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 03:30:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:30:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:30:46,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:30:46,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:30:46,323 INFO L87 Difference]: Start difference. First operand 1130 states and 1438 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-02-06 03:30:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:30:47,053 INFO L93 Difference]: Finished difference Result 2315 states and 2936 transitions. [2025-02-06 03:30:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:30:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 272 [2025-02-06 03:30:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:30:47,060 INFO L225 Difference]: With dead ends: 2315 [2025-02-06 03:30:47,060 INFO L226 Difference]: Without dead ends: 1332 [2025-02-06 03:30:47,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:30:47,063 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 290 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:30:47,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 498 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:30:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-02-06 03:30:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1144. [2025-02-06 03:30:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 953 states have (on average 1.1783840503672613) internal successors, (1123), 963 states have internal predecessors, (1123), 162 states have call successors, (162), 28 states have call predecessors, (162), 28 states have return successors, (162), 152 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-06 03:30:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1447 transitions. [2025-02-06 03:30:47,212 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1447 transitions. Word has length 272 [2025-02-06 03:30:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:30:47,213 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1447 transitions. [2025-02-06 03:30:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-02-06 03:30:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1447 transitions. [2025-02-06 03:30:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-06 03:30:47,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:30:47,217 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:30:47,229 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-06 03:30:47,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:30:47,421 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:30:47,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:30:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1421149566, now seen corresponding path program 1 times [2025-02-06 03:30:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:30:47,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510522227] [2025-02-06 03:30:47,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:30:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:30:47,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-06 03:30:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 03:30:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:30:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat