./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.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-p_file-12.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 7d22deea41fa59fa50d8ffe4393e1dc9de22de8468ac22621a99fafe2a1542e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:35:48,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:35:48,323 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:35:48,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:35:48,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:35:48,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:35:48,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:35:48,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:35:48,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:35:48,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:35:48,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:35:48,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:35:48,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:35:48,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:35:48,355 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:35:48,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:35:48,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:35:48,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:35:48,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:35:48,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:35:48,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:35:48,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:35:48,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:35:48,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:35:48,358 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 -> 7d22deea41fa59fa50d8ffe4393e1dc9de22de8468ac22621a99fafe2a1542e8 [2025-02-06 03:35:48,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:35:48,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:35:48,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:35:48,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:35:48,631 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:35:48,632 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-p_file-12.i [2025-02-06 03:35:49,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7e1139dd/02726f3f4b4b4a5dbe72ed4519cbf18d/FLAGe88112809 [2025-02-06 03:35:50,141 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:35:50,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i [2025-02-06 03:35:50,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7e1139dd/02726f3f4b4b4a5dbe72ed4519cbf18d/FLAGe88112809 [2025-02-06 03:35:50,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7e1139dd/02726f3f4b4b4a5dbe72ed4519cbf18d [2025-02-06 03:35:50,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:35:50,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:35:50,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:35:50,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:35:50,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:35:50,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf5d8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50, skipping insertion in model container [2025-02-06 03:35:50,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:35:50,524 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-p_file-12.i[916,929] [2025-02-06 03:35:50,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:35:50,585 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:35:50,594 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-p_file-12.i[916,929] [2025-02-06 03:35:50,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:35:50,641 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:35:50,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50 WrapperNode [2025-02-06 03:35:50,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:35:50,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:35:50,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:35:50,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:35:50,648 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:35:50" (1/1) ... [2025-02-06 03:35:50,658 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:35:50" (1/1) ... [2025-02-06 03:35:50,694 INFO L138 Inliner]: procedures = 26, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2025-02-06 03:35:50,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:35:50,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:35:50,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:35:50,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:35:50,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,722 INFO L175 MemorySlicer]: Split 123 memory accesses to 12 slices as follows [2, 5, 6, 6, 8, 10, 23, 10, 18, 20, 7, 8]. 19 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1]. [2025-02-06 03:35:50,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:35:50,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:35:50,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:35:50,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:35:50,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (1/1) ... [2025-02-06 03:35:50,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:35:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:35:50,759 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:35:50,761 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:35:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:35:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:35:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:35:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:35:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:35:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:35:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:35:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:35:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:35:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:35:50,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:35:50,891 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:35:50,892 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:35:51,297 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1; [2025-02-06 03:35:51,339 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-06 03:35:51,339 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:35:51,349 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:35:51,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:35:51,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:35:51 BoogieIcfgContainer [2025-02-06 03:35:51,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:35:51,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:35:51,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:35:51,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:35:51,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:35:50" (1/3) ... [2025-02-06 03:35:51,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4551cea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:35:51, skipping insertion in model container [2025-02-06 03:35:51,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:35:50" (2/3) ... [2025-02-06 03:35:51,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4551cea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:35:51, skipping insertion in model container [2025-02-06 03:35:51,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:35:51" (3/3) ... [2025-02-06 03:35:51,358 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-12.i [2025-02-06 03:35:51,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:35:51,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-12.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:35:51,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:35:51,423 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;@22a1fe10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:35:51,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:35:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:35:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:35:51,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:35:51,437 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:51,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:35:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:35:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 825168545, now seen corresponding path program 1 times [2025-02-06 03:35:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:35:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095020610] [2025-02-06 03:35:51,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:35:51,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:35:51,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:35:51,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:51,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 03:35:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:35:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095020610] [2025-02-06 03:35:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095020610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:35:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071620858] [2025-02-06 03:35:51,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:35:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:35:51,719 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:35:51,720 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:35:51,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:35:51,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:35:51,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:51,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:35:51,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:35:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 03:35:51,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:35:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071620858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:35:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:35:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:35:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797810218] [2025-02-06 03:35:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:35:51,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:35:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:35:51,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:35:51,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:35:51,909 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:35:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:35:51,924 INFO L93 Difference]: Finished difference Result 182 states and 281 transitions. [2025-02-06 03:35:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:35:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-02-06 03:35:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:35:51,928 INFO L225 Difference]: With dead ends: 182 [2025-02-06 03:35:51,928 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 03:35:51,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:35:51,931 INFO L435 NwaCegarLoop]: 123 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, 123 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:35:51,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:35:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 03:35:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 03:35:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:35:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-02-06 03:35:51,960 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117 [2025-02-06 03:35:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:35:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-02-06 03:35:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:35:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-02-06 03:35:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:35:51,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:35:51,963 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:51,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:35:52,164 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:35:52,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:35:52,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:35:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1491333777, now seen corresponding path program 1 times [2025-02-06 03:35:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:35:52,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359393182] [2025-02-06 03:35:52,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:35:52,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:35:52,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:35:52,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:52,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:35:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:35:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359393182] [2025-02-06 03:35:52,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359393182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:35:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165377831] [2025-02-06 03:35:52,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:52,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:35:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:35:52,626 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:35:52,628 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:35:52,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:35:52,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:35:52,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:52,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:52,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:35:52,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:35:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:35:52,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:35:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165377831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:35:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:35:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:35:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847270743] [2025-02-06 03:35:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:35:52,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:35:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:35:52,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:35:52,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:35:52,821 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:35:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:35:52,841 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2025-02-06 03:35:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:35:52,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-02-06 03:35:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:35:52,842 INFO L225 Difference]: With dead ends: 173 [2025-02-06 03:35:52,842 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 03:35:52,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:35:52,843 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:35:52,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:35:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 03:35:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 03:35:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:35:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-02-06 03:35:52,850 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117 [2025-02-06 03:35:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:35:52,854 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-02-06 03:35:52,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:35:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-02-06 03:35:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:35:52,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:35:52,855 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:52,861 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:35:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:35:53,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:35:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:35:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1309974883, now seen corresponding path program 1 times [2025-02-06 03:35:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:35:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368435132] [2025-02-06 03:35:53,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:35:53,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:35:53,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:35:53,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:53,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:35:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:35:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368435132] [2025-02-06 03:35:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368435132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:35:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041890628] [2025-02-06 03:35:53,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:53,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:35:53,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:35:53,280 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:35:53,282 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:35:53,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:35:53,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:35:53,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:53,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:53,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:35:53,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:35:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:35:53,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:35:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041890628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:35:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:35:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:35:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79589060] [2025-02-06 03:35:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:35:53,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:35:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:35:53,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:35:53,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:35:53,472 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:35:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:35:53,514 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2025-02-06 03:35:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:35:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-02-06 03:35:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:35:53,516 INFO L225 Difference]: With dead ends: 176 [2025-02-06 03:35:53,516 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:35:53,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:35:53,519 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:35:53,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:35:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:35:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:35:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:35:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-02-06 03:35:53,531 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119 [2025-02-06 03:35:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:35:53,531 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-02-06 03:35:53,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:35:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-02-06 03:35:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:35:53,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:35:53,533 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:53,546 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:35:53,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:35:53,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:35:53,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:35:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash -79662761, now seen corresponding path program 1 times [2025-02-06 03:35:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:35:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648510002] [2025-02-06 03:35:53,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:35:53,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:35:53,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:35:53,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:53,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:35:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:35:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648510002] [2025-02-06 03:35:54,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648510002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:35:54,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:35:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:35:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187728224] [2025-02-06 03:35:54,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:35:54,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:35:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:35:54,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:35:54,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:35:54,646 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:35:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:35:55,078 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2025-02-06 03:35:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:35:55,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 121 [2025-02-06 03:35:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:35:55,080 INFO L225 Difference]: With dead ends: 165 [2025-02-06 03:35:55,080 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 03:35:55,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:35:55,081 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 180 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:35:55,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1036 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:35:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 03:35:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2025-02-06 03:35:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 128 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:35:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2025-02-06 03:35:55,111 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 121 [2025-02-06 03:35:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:35:55,111 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2025-02-06 03:35:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:35:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2025-02-06 03:35:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:35:55,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:35:55,113 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:35:55,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:35:55,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:35:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash 939240366, now seen corresponding path program 1 times [2025-02-06 03:35:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:35:55,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881996350] [2025-02-06 03:35:55,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:35:55,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:35:55,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:35:55,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:55,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:35:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:35:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881996350] [2025-02-06 03:35:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881996350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:35:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404459388] [2025-02-06 03:35:56,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:35:56,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:35:56,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:35:56,393 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:35:56,399 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:35:56,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:35:56,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:35:56,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:35:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:35:56,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-06 03:35:56,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:35:57,082 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:35:57,626 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:35:58,026 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 27 treesize of output 19 [2025-02-06 03:35:58,043 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 11 [2025-02-06 03:35:58,387 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 40 treesize of output 28 [2025-02-06 03:35:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-06 03:35:58,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:35:59,265 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 42 treesize of output 38 [2025-02-06 03:36:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404459388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:00,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:36:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 42 [2025-02-06 03:36:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021352231] [2025-02-06 03:36:00,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:36:00,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 03:36:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:00,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 03:36:00,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3303, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 03:36:00,188 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand has 42 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 36 states have internal predecessors, (101), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2025-02-06 03:36:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:02,962 INFO L93 Difference]: Finished difference Result 294 states and 372 transitions. [2025-02-06 03:36:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-06 03:36:02,963 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 36 states have internal predecessors, (101), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 122 [2025-02-06 03:36:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:02,966 INFO L225 Difference]: With dead ends: 294 [2025-02-06 03:36:02,966 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 03:36:02,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1724, Invalid=9196, Unknown=0, NotChecked=0, Total=10920 [2025-02-06 03:36:02,971 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 757 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:02,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 2372 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:36:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 03:36:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 184. [2025-02-06 03:36:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 146 states have internal predecessors, (176), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:36:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 236 transitions. [2025-02-06 03:36:02,999 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 236 transitions. Word has length 122 [2025-02-06 03:36:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:03,000 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 236 transitions. [2025-02-06 03:36:03,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 36 states have internal predecessors, (101), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2025-02-06 03:36:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 236 transitions. [2025-02-06 03:36:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:36:03,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:03,001 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:03,008 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:36:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:03,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:03,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1530609216, now seen corresponding path program 1 times [2025-02-06 03:36:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746130573] [2025-02-06 03:36:03,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:03,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:36:03,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:36:03,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:03,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:36:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746130573] [2025-02-06 03:36:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746130573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538009217] [2025-02-06 03:36:04,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:04,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:04,285 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:36:04,286 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:36:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:36:04,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:36:04,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:04,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:04,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 03:36:04,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:04,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 03:36:05,683 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:36:06,158 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 25 treesize of output 17 [2025-02-06 03:36:06,176 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-06 03:36:06,177 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 1 case distinctions, treesize of input 23 treesize of output 30 [2025-02-06 03:36:06,357 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 40 treesize of output 28 [2025-02-06 03:36:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-06 03:36:06,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:07,166 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 42 treesize of output 38 [2025-02-06 03:36:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538009217] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:08,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:36:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 46 [2025-02-06 03:36:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129772143] [2025-02-06 03:36:08,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:36:08,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 03:36:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:08,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 03:36:08,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3775, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 03:36:08,032 INFO L87 Difference]: Start difference. First operand 184 states and 236 transitions. Second operand has 46 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 39 states have internal predecessors, (109), 12 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2025-02-06 03:36:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:11,990 INFO L93 Difference]: Finished difference Result 279 states and 349 transitions. [2025-02-06 03:36:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-06 03:36:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 39 states have internal predecessors, (109), 12 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 123 [2025-02-06 03:36:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:11,993 INFO L225 Difference]: With dead ends: 279 [2025-02-06 03:36:11,993 INFO L226 Difference]: Without dead ends: 277 [2025-02-06 03:36:11,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4051 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2002, Invalid=12518, Unknown=0, NotChecked=0, Total=14520 [2025-02-06 03:36:11,997 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 928 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:11,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 2679 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:36:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-06 03:36:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 189. [2025-02-06 03:36:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 149 states have (on average 1.2080536912751678) internal successors, (180), 150 states have internal predecessors, (180), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:36:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2025-02-06 03:36:12,024 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 123 [2025-02-06 03:36:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:12,024 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2025-02-06 03:36:12,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 39 states have internal predecessors, (109), 12 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2025-02-06 03:36:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2025-02-06 03:36:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:36:12,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:12,025 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,033 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:36:12,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:12,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300440, now seen corresponding path program 1 times [2025-02-06 03:36:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831557472] [2025-02-06 03:36:12,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:36:12,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:36:12,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:12,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:36:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831557472] [2025-02-06 03:36:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831557472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118371213] [2025-02-06 03:36:12,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:12,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:12,574 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:36:12,575 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:36:12,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:36:12,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:36:12,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:12,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:12,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:36:12,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:12,823 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:36:12,967 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 35 treesize of output 23 [2025-02-06 03:36:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:36:12,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:13,146 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 27 treesize of output 23 [2025-02-06 03:36:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:36:13,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118371213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:36:13,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:36:13,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-02-06 03:36:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069471163] [2025-02-06 03:36:13,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:36:13,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:36:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:36:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:36:13,184 INFO L87 Difference]: Start difference. First operand 189 states and 240 transitions. Second operand has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2025-02-06 03:36:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:13,431 INFO L93 Difference]: Finished difference Result 391 states and 491 transitions. [2025-02-06 03:36:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:36:13,432 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) Word has length 124 [2025-02-06 03:36:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:13,433 INFO L225 Difference]: With dead ends: 391 [2025-02-06 03:36:13,433 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 03:36:13,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:36:13,434 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 344 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:13,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 516 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 03:36:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 197. [2025-02-06 03:36:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.1935483870967742) internal successors, (185), 156 states have internal predecessors, (185), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:36:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2025-02-06 03:36:13,481 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 124 [2025-02-06 03:36:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:13,481 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2025-02-06 03:36:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2025-02-06 03:36:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2025-02-06 03:36:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:36:13,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:13,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:36:13,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 03:36:13,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1805566955, now seen corresponding path program 1 times [2025-02-06 03:36:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084617990] [2025-02-06 03:36:13,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:13,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:36:13,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:36:13,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:13,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084617990] [2025-02-06 03:36:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084617990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:13,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:36:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013985306] [2025-02-06 03:36:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:13,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:36:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:13,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:36:13,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:36:13,811 INFO L87 Difference]: Start difference. First operand 197 states and 245 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:13,877 INFO L93 Difference]: Finished difference Result 453 states and 563 transitions. [2025-02-06 03:36:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:36:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-02-06 03:36:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:13,881 INFO L225 Difference]: With dead ends: 453 [2025-02-06 03:36:13,881 INFO L226 Difference]: Without dead ends: 259 [2025-02-06 03:36:13,881 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:36:13,882 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 32 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:13,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 455 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:36:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-06 03:36:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 218. [2025-02-06 03:36:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:36:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2025-02-06 03:36:13,906 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 124 [2025-02-06 03:36:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:13,906 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2025-02-06 03:36:13,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2025-02-06 03:36:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:36:13,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:13,907 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:36:13,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -821114822, now seen corresponding path program 1 times [2025-02-06 03:36:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:13,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487360507] [2025-02-06 03:36:13,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:13,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:36:13,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:36:13,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:13,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:36:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487360507] [2025-02-06 03:36:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487360507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403488542] [2025-02-06 03:36:14,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:14,142 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:36:14,150 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:36:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:36:14,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:36:14,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:14,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:14,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:36:14,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:14,348 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:36:14,501 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 35 treesize of output 23 [2025-02-06 03:36:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:36:14,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:14,679 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 27 treesize of output 23 [2025-02-06 03:36:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:36:14,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403488542] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:36:14,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:36:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-02-06 03:36:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446221956] [2025-02-06 03:36:14,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:36:14,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:36:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:14,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:36:14,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:36:14,723 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand has 14 states, 11 states have (on average 5.818181818181818) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2025-02-06 03:36:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:14,950 INFO L93 Difference]: Finished difference Result 441 states and 543 transitions. [2025-02-06 03:36:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:36:14,951 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.818181818181818) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) Word has length 125 [2025-02-06 03:36:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:14,954 INFO L225 Difference]: With dead ends: 441 [2025-02-06 03:36:14,954 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 03:36:14,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:36:14,955 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 265 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:14,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 432 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 03:36:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2025-02-06 03:36:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.1761363636363635) internal successors, (207), 177 states have internal predecessors, (207), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:36:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2025-02-06 03:36:14,977 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 125 [2025-02-06 03:36:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2025-02-06 03:36:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.818181818181818) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2025-02-06 03:36:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2025-02-06 03:36:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:36:14,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:14,979 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:14,986 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:36:15,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:15,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:15,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2035570058, now seen corresponding path program 1 times [2025-02-06 03:36:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780721495] [2025-02-06 03:36:15,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:15,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:36:15,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:36:15,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:15,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:36:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314481072] [2025-02-06 03:36:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:15,250 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:36:15,251 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:36:15,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:36:15,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:36:15,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:15,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:15,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 03:36:15,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:15,922 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:36:16,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:36:16,582 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 33 treesize of output 25 [2025-02-06 03:36:16,588 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 63 treesize of output 43 [2025-02-06 03:36:16,592 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 53 treesize of output 37 [2025-02-06 03:36:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 253 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-06 03:36:16,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780721495] [2025-02-06 03:36:16,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:36:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314481072] [2025-02-06 03:36:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314481072] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:16,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:36:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2025-02-06 03:36:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029906734] [2025-02-06 03:36:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:16,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:36:16,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:16,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:36:16,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:36:16,977 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:17,359 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2025-02-06 03:36:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:36:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2025-02-06 03:36:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:17,361 INFO L225 Difference]: With dead ends: 477 [2025-02-06 03:36:17,361 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 03:36:17,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:36:17,368 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 200 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:17,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 587 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 03:36:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2025-02-06 03:36:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 202 states have (on average 1.1485148514851484) internal successors, (232), 204 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 16 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:36:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 312 transitions. [2025-02-06 03:36:17,396 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 312 transitions. Word has length 126 [2025-02-06 03:36:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:17,398 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 312 transitions. [2025-02-06 03:36:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 312 transitions. [2025-02-06 03:36:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:36:17,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:17,399 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:17,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:36:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:17,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1208991588, now seen corresponding path program 1 times [2025-02-06 03:36:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133068817] [2025-02-06 03:36:17,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:17,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:36:17,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:36:17,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:17,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:36:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361770372] [2025-02-06 03:36:17,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:17,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:17,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:17,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:36:17,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:36:17,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:36:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:36:17,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:17,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:17,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 03:36:17,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:18,250 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:36:18,361 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:36:18,534 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 44 treesize of output 32 [2025-02-06 03:36:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-06 03:36:18,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133068817] [2025-02-06 03:36:18,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:36:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361770372] [2025-02-06 03:36:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361770372] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:18,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:36:18,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2025-02-06 03:36:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919775656] [2025-02-06 03:36:18,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:18,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:36:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:18,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:36:18,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:36:18,873 INFO L87 Difference]: Start difference. First operand 259 states and 312 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:19,509 INFO L93 Difference]: Finished difference Result 571 states and 685 transitions. [2025-02-06 03:36:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:36:19,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2025-02-06 03:36:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:19,514 INFO L225 Difference]: With dead ends: 571 [2025-02-06 03:36:19,514 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 03:36:19,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:36:19,519 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 100 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:19,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 419 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:36:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 03:36:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 301. [2025-02-06 03:36:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 243 states have (on average 1.1563786008230452) internal successors, (281), 245 states have internal predecessors, (281), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:36:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 361 transitions. [2025-02-06 03:36:19,549 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 361 transitions. Word has length 127 [2025-02-06 03:36:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:19,549 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 361 transitions. [2025-02-06 03:36:19,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 361 transitions. [2025-02-06 03:36:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:36:19,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:19,550 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 03:36:19,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:19,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:19,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -311401165, now seen corresponding path program 1 times [2025-02-06 03:36:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427538362] [2025-02-06 03:36:19,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:19,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:36:19,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:36:19,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:36:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748546812] [2025-02-06 03:36:19,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:19,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:19,798 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:36:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 03:36:19,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:36:20,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:36:20,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:20,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:20,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:36:20,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:20,306 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:36:20,378 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 35 treesize of output 27 [2025-02-06 03:36:20,380 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 45 treesize of output 25 [2025-02-06 03:36:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 03:36:20,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427538362] [2025-02-06 03:36:20,552 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:36:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748546812] [2025-02-06 03:36:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748546812] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:20,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:36:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-02-06 03:36:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088056996] [2025-02-06 03:36:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:36:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:36:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:36:20,554 INFO L87 Difference]: Start difference. First operand 301 states and 361 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:20,780 INFO L93 Difference]: Finished difference Result 651 states and 776 transitions. [2025-02-06 03:36:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:36:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-02-06 03:36:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:20,782 INFO L225 Difference]: With dead ends: 651 [2025-02-06 03:36:20,782 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 03:36:20,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:36:20,783 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 163 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:20,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 536 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 03:36:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2025-02-06 03:36:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 274 states have (on average 1.135036496350365) internal successors, (311), 277 states have internal predecessors, (311), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 415 transitions. [2025-02-06 03:36:20,838 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 415 transitions. Word has length 128 [2025-02-06 03:36:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:20,838 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 415 transitions. [2025-02-06 03:36:20,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 415 transitions. [2025-02-06 03:36:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:36:20,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:20,839 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:20,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 03:36:21,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 03:36:21,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1612062131, now seen corresponding path program 1 times [2025-02-06 03:36:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659962520] [2025-02-06 03:36:21,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:21,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:36:21,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:36:21,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:21,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:36:21,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655122942] [2025-02-06 03:36:21,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:36:21,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:36:21,070 INFO L229 MonitoredProcess]: Starting monitored process 12 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:36:21,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 03:36:21,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:36:21,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:36:21,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:21,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:21,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 03:36:21,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:36:21,804 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:36:21,875 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 49 treesize of output 29 [2025-02-06 03:36:21,879 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 27 treesize of output 19 [2025-02-06 03:36:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:36:21,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:36:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:22,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:22,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659962520] [2025-02-06 03:36:22,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:36:22,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655122942] [2025-02-06 03:36:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655122942] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:36:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:36:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-02-06 03:36:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106122289] [2025-02-06 03:36:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:36:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:22,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:36:22,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:36:22,044 INFO L87 Difference]: Start difference. First operand 350 states and 415 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:22,284 INFO L93 Difference]: Finished difference Result 662 states and 783 transitions. [2025-02-06 03:36:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:36:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-02-06 03:36:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:22,287 INFO L225 Difference]: With dead ends: 662 [2025-02-06 03:36:22,288 INFO L226 Difference]: Without dead ends: 360 [2025-02-06 03:36:22,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 242 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:36:22,288 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:22,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 546 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-06 03:36:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 307. [2025-02-06 03:36:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 245 states have (on average 1.1428571428571428) internal successors, (280), 247 states have internal predecessors, (280), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:36:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 364 transitions. [2025-02-06 03:36:22,319 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 364 transitions. Word has length 128 [2025-02-06 03:36:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:22,319 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 364 transitions. [2025-02-06 03:36:22,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 364 transitions. [2025-02-06 03:36:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:22,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:22,320 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:22,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 03:36:22,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 03:36:22,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:22,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash 893535468, now seen corresponding path program 1 times [2025-02-06 03:36:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022579307] [2025-02-06 03:36:22,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:22,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:22,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:22,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:22,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022579307] [2025-02-06 03:36:22,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022579307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:22,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:22,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:36:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292176183] [2025-02-06 03:36:22,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:22,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:36:22,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:22,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:36:22,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:36:22,980 INFO L87 Difference]: Start difference. First operand 307 states and 364 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:23,455 INFO L93 Difference]: Finished difference Result 833 states and 988 transitions. [2025-02-06 03:36:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:36:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-02-06 03:36:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:23,458 INFO L225 Difference]: With dead ends: 833 [2025-02-06 03:36:23,458 INFO L226 Difference]: Without dead ends: 529 [2025-02-06 03:36:23,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:36:23,459 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 90 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:23,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1806 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-06 03:36:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 352. [2025-02-06 03:36:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 290 states have (on average 1.1724137931034482) internal successors, (340), 292 states have internal predecessors, (340), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:36:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 424 transitions. [2025-02-06 03:36:23,501 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 424 transitions. Word has length 129 [2025-02-06 03:36:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:23,501 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 424 transitions. [2025-02-06 03:36:23,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2025-02-06 03:36:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:23,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:23,502 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:23,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:36:23,502 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 697021963, now seen corresponding path program 1 times [2025-02-06 03:36:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288583068] [2025-02-06 03:36:23,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:23,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:23,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:23,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:23,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288583068] [2025-02-06 03:36:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288583068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:36:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496793403] [2025-02-06 03:36:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:23,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:36:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:23,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:36:23,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:36:23,758 INFO L87 Difference]: Start difference. First operand 352 states and 424 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:24,102 INFO L93 Difference]: Finished difference Result 981 states and 1184 transitions. [2025-02-06 03:36:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:36:24,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-02-06 03:36:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:24,105 INFO L225 Difference]: With dead ends: 981 [2025-02-06 03:36:24,105 INFO L226 Difference]: Without dead ends: 632 [2025-02-06 03:36:24,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:36:24,106 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 172 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:24,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 581 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-02-06 03:36:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 498. [2025-02-06 03:36:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 421 states have (on average 1.1923990498812351) internal successors, (502), 424 states have internal predecessors, (502), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 606 transitions. [2025-02-06 03:36:24,159 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 606 transitions. Word has length 129 [2025-02-06 03:36:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:24,159 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 606 transitions. [2025-02-06 03:36:24,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 606 transitions. [2025-02-06 03:36:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:24,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:24,160 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:36:24,161 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1425239952, now seen corresponding path program 1 times [2025-02-06 03:36:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99266204] [2025-02-06 03:36:24,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:24,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:24,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:24,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:24,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99266204] [2025-02-06 03:36:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99266204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:36:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995649353] [2025-02-06 03:36:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:24,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:36:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:24,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:36:24,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:36:24,497 INFO L87 Difference]: Start difference. First operand 498 states and 606 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:24,940 INFO L93 Difference]: Finished difference Result 1209 states and 1466 transitions. [2025-02-06 03:36:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:36:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-02-06 03:36:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:24,943 INFO L225 Difference]: With dead ends: 1209 [2025-02-06 03:36:24,943 INFO L226 Difference]: Without dead ends: 714 [2025-02-06 03:36:24,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:36:24,945 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 177 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:24,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 864 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-02-06 03:36:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 536. [2025-02-06 03:36:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 459 states have (on average 1.196078431372549) internal successors, (549), 462 states have internal predecessors, (549), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 653 transitions. [2025-02-06 03:36:25,055 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 653 transitions. Word has length 129 [2025-02-06 03:36:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:25,055 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 653 transitions. [2025-02-06 03:36:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 653 transitions. [2025-02-06 03:36:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:25,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:25,057 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:25,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:36:25,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:25,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1296157233, now seen corresponding path program 1 times [2025-02-06 03:36:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:25,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991871406] [2025-02-06 03:36:25,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:25,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:25,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:25,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:25,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991871406] [2025-02-06 03:36:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991871406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:25,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:36:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124440021] [2025-02-06 03:36:25,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:36:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:25,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:36:25,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:36:25,205 INFO L87 Difference]: Start difference. First operand 536 states and 653 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:25,394 INFO L93 Difference]: Finished difference Result 1200 states and 1448 transitions. [2025-02-06 03:36:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:36:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-02-06 03:36:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:25,397 INFO L225 Difference]: With dead ends: 1200 [2025-02-06 03:36:25,397 INFO L226 Difference]: Without dead ends: 667 [2025-02-06 03:36:25,398 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:36:25,399 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 79 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:25,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 560 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-06 03:36:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 533. [2025-02-06 03:36:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 456 states have (on average 1.1710526315789473) internal successors, (534), 459 states have internal predecessors, (534), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 638 transitions. [2025-02-06 03:36:25,467 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 638 transitions. Word has length 129 [2025-02-06 03:36:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:25,467 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 638 transitions. [2025-02-06 03:36:25,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 638 transitions. [2025-02-06 03:36:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:25,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:25,469 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:25,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:36:25,470 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash 826528715, now seen corresponding path program 1 times [2025-02-06 03:36:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478615153] [2025-02-06 03:36:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:25,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:25,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:25,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:25,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:25,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:25,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478615153] [2025-02-06 03:36:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478615153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:25,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:36:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109802074] [2025-02-06 03:36:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:36:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:25,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:36:25,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:36:25,744 INFO L87 Difference]: Start difference. First operand 533 states and 638 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:26,093 INFO L93 Difference]: Finished difference Result 1161 states and 1382 transitions. [2025-02-06 03:36:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:36:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-02-06 03:36:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:26,096 INFO L225 Difference]: With dead ends: 1161 [2025-02-06 03:36:26,096 INFO L226 Difference]: Without dead ends: 631 [2025-02-06 03:36:26,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:36:26,097 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 274 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:26,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 583 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-06 03:36:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 497. [2025-02-06 03:36:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 420 states have (on average 1.1690476190476191) internal successors, (491), 423 states have internal predecessors, (491), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 595 transitions. [2025-02-06 03:36:26,181 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 595 transitions. Word has length 129 [2025-02-06 03:36:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:26,181 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 595 transitions. [2025-02-06 03:36:26,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 595 transitions. [2025-02-06 03:36:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:26,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:26,183 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:36:26,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1590696304, now seen corresponding path program 1 times [2025-02-06 03:36:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509814382] [2025-02-06 03:36:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:26,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:26,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:26,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:26,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509814382] [2025-02-06 03:36:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509814382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:36:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336895790] [2025-02-06 03:36:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:36:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:36:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:36:26,625 INFO L87 Difference]: Start difference. First operand 497 states and 595 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:27,121 INFO L93 Difference]: Finished difference Result 1143 states and 1359 transitions. [2025-02-06 03:36:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:36:27,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-02-06 03:36:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:27,124 INFO L225 Difference]: With dead ends: 1143 [2025-02-06 03:36:27,124 INFO L226 Difference]: Without dead ends: 649 [2025-02-06 03:36:27,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:36:27,125 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 258 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:27,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 849 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-06 03:36:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 493. [2025-02-06 03:36:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 416 states have (on average 1.1634615384615385) internal successors, (484), 419 states have internal predecessors, (484), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 588 transitions. [2025-02-06 03:36:27,192 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 588 transitions. Word has length 129 [2025-02-06 03:36:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:27,193 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 588 transitions. [2025-02-06 03:36:27,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 588 transitions. [2025-02-06 03:36:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:27,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:27,194 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:27,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:36:27,194 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:27,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -728079116, now seen corresponding path program 1 times [2025-02-06 03:36:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368933270] [2025-02-06 03:36:27,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:27,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:27,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:27,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:27,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368933270] [2025-02-06 03:36:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368933270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:36:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206129694] [2025-02-06 03:36:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:36:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:28,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:36:28,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:36:28,053 INFO L87 Difference]: Start difference. First operand 493 states and 588 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:29,140 INFO L93 Difference]: Finished difference Result 1211 states and 1433 transitions. [2025-02-06 03:36:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:36:29,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-02-06 03:36:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:29,147 INFO L225 Difference]: With dead ends: 1211 [2025-02-06 03:36:29,147 INFO L226 Difference]: Without dead ends: 721 [2025-02-06 03:36:29,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:36:29,150 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 259 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:29,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1887 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:36:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-06 03:36:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 535. [2025-02-06 03:36:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 458 states have (on average 1.168122270742358) internal successors, (535), 461 states have internal predecessors, (535), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 639 transitions. [2025-02-06 03:36:29,217 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 639 transitions. Word has length 129 [2025-02-06 03:36:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:29,218 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 639 transitions. [2025-02-06 03:36:29,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 639 transitions. [2025-02-06 03:36:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:29,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:29,219 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:36:29,219 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:29,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -924592621, now seen corresponding path program 1 times [2025-02-06 03:36:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304052183] [2025-02-06 03:36:29,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:29,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:29,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:29,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:29,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304052183] [2025-02-06 03:36:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304052183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:36:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624981561] [2025-02-06 03:36:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:29,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:36:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:29,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:36:29,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:36:29,352 INFO L87 Difference]: Start difference. First operand 535 states and 639 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:29,545 INFO L93 Difference]: Finished difference Result 1199 states and 1424 transitions. [2025-02-06 03:36:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:36:29,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-02-06 03:36:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:29,548 INFO L225 Difference]: With dead ends: 1199 [2025-02-06 03:36:29,548 INFO L226 Difference]: Without dead ends: 667 [2025-02-06 03:36:29,549 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:36:29,550 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 75 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:29,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 564 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-06 03:36:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 537. [2025-02-06 03:36:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 460 states have (on average 1.1586956521739131) internal successors, (533), 463 states have internal predecessors, (533), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 637 transitions. [2025-02-06 03:36:29,612 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 637 transitions. Word has length 129 [2025-02-06 03:36:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:29,612 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 637 transitions. [2025-02-06 03:36:29,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 637 transitions. [2025-02-06 03:36:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:29,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:29,613 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:36:29,613 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:29,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash -795085869, now seen corresponding path program 1 times [2025-02-06 03:36:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:29,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182405731] [2025-02-06 03:36:29,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:29,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:29,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:29,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182405731] [2025-02-06 03:36:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182405731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:36:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115502546] [2025-02-06 03:36:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:36:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:29,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:36:29,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:36:29,767 INFO L87 Difference]: Start difference. First operand 537 states and 637 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:30,074 INFO L93 Difference]: Finished difference Result 1141 states and 1345 transitions. [2025-02-06 03:36:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:36:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-02-06 03:36:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:30,080 INFO L225 Difference]: With dead ends: 1141 [2025-02-06 03:36:30,080 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 03:36:30,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:36:30,081 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 87 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:30,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 574 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 03:36:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 490. [2025-02-06 03:36:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 413 states have (on average 1.1549636803874093) internal successors, (477), 416 states have internal predecessors, (477), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 581 transitions. [2025-02-06 03:36:30,145 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 581 transitions. Word has length 129 [2025-02-06 03:36:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 581 transitions. [2025-02-06 03:36:30,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 581 transitions. [2025-02-06 03:36:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:30,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:30,146 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:30,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:36:30,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 728041770, now seen corresponding path program 1 times [2025-02-06 03:36:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:30,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136429030] [2025-02-06 03:36:30,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:30,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:30,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:30,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:30,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136429030] [2025-02-06 03:36:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136429030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:30,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:30,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:36:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771609750] [2025-02-06 03:36:30,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:30,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:36:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:30,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:36:30,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:36:30,675 INFO L87 Difference]: Start difference. First operand 490 states and 581 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 03:36:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:31,025 INFO L93 Difference]: Finished difference Result 936 states and 1103 transitions. [2025-02-06 03:36:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:36:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-02-06 03:36:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:31,031 INFO L225 Difference]: With dead ends: 936 [2025-02-06 03:36:31,031 INFO L226 Difference]: Without dead ends: 449 [2025-02-06 03:36:31,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:36:31,033 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:31,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 403 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-06 03:36:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2025-02-06 03:36:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.1290322580645162) internal successors, (420), 375 states have internal predecessors, (420), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 524 transitions. [2025-02-06 03:36:31,111 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 524 transitions. Word has length 129 [2025-02-06 03:36:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 524 transitions. [2025-02-06 03:36:31,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 03:36:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 524 transitions. [2025-02-06 03:36:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:31,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:31,116 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:31,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:36:31,116 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 857548522, now seen corresponding path program 1 times [2025-02-06 03:36:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264920339] [2025-02-06 03:36:31,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:31,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:31,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:31,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:31,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264920339] [2025-02-06 03:36:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264920339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:36:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502715756] [2025-02-06 03:36:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:36:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:31,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:36:31,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:36:31,617 INFO L87 Difference]: Start difference. First operand 449 states and 524 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 03:36:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:32,177 INFO L93 Difference]: Finished difference Result 1060 states and 1228 transitions. [2025-02-06 03:36:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:36:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-02-06 03:36:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:32,180 INFO L225 Difference]: With dead ends: 1060 [2025-02-06 03:36:32,180 INFO L226 Difference]: Without dead ends: 614 [2025-02-06 03:36:32,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:36:32,181 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 329 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:32,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 741 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-06 03:36:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 449. [2025-02-06 03:36:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.1209677419354838) internal successors, (417), 375 states have internal predecessors, (417), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 521 transitions. [2025-02-06 03:36:32,248 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 521 transitions. Word has length 129 [2025-02-06 03:36:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 521 transitions. [2025-02-06 03:36:32,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 03:36:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 521 transitions. [2025-02-06 03:36:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:32,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:32,249 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:36:32,249 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:32,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 986631241, now seen corresponding path program 1 times [2025-02-06 03:36:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356950815] [2025-02-06 03:36:32,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:32,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:32,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:32,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:32,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:32,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356950815] [2025-02-06 03:36:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356950815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:32,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:36:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11727385] [2025-02-06 03:36:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:32,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:36:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:32,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:36:32,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:36:32,701 INFO L87 Difference]: Start difference. First operand 449 states and 521 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 03:36:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:33,282 INFO L93 Difference]: Finished difference Result 1060 states and 1222 transitions. [2025-02-06 03:36:33,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:36:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-02-06 03:36:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:33,284 INFO L225 Difference]: With dead ends: 1060 [2025-02-06 03:36:33,284 INFO L226 Difference]: Without dead ends: 614 [2025-02-06 03:36:33,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:36:33,286 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 246 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:33,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 780 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-06 03:36:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 449. [2025-02-06 03:36:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.1129032258064515) internal successors, (414), 375 states have internal predecessors, (414), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 518 transitions. [2025-02-06 03:36:33,358 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 518 transitions. Word has length 129 [2025-02-06 03:36:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 518 transitions. [2025-02-06 03:36:33,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 03:36:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 518 transitions. [2025-02-06 03:36:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:33,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:33,362 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:33,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:36:33,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash 790117736, now seen corresponding path program 1 times [2025-02-06 03:36:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208958739] [2025-02-06 03:36:33,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:33,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:33,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:33,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:33,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:33,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208958739] [2025-02-06 03:36:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208958739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:33,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:36:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426560298] [2025-02-06 03:36:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:33,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:36:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:33,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:36:33,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:36:33,815 INFO L87 Difference]: Start difference. First operand 449 states and 518 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:34,368 INFO L93 Difference]: Finished difference Result 1122 states and 1295 transitions. [2025-02-06 03:36:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:36:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-02-06 03:36:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:34,371 INFO L225 Difference]: With dead ends: 1122 [2025-02-06 03:36:34,371 INFO L226 Difference]: Without dead ends: 676 [2025-02-06 03:36:34,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:36:34,372 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 83 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:34,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1977 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-02-06 03:36:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 487. [2025-02-06 03:36:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 410 states have (on average 1.1243902439024391) internal successors, (461), 413 states have internal predecessors, (461), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 565 transitions. [2025-02-06 03:36:34,464 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 565 transitions. Word has length 129 [2025-02-06 03:36:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:34,468 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 565 transitions. [2025-02-06 03:36:34,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 565 transitions. [2025-02-06 03:36:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:34,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:34,469 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:34,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:36:34,470 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:34,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1332144179, now seen corresponding path program 1 times [2025-02-06 03:36:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066306088] [2025-02-06 03:36:34,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:34,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:34,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:34,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:34,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066306088] [2025-02-06 03:36:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066306088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:36:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221388603] [2025-02-06 03:36:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:34,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:36:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:34,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:36:34,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:36:34,796 INFO L87 Difference]: Start difference. First operand 487 states and 565 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:35,277 INFO L93 Difference]: Finished difference Result 1118 states and 1289 transitions. [2025-02-06 03:36:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:36:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-02-06 03:36:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:35,281 INFO L225 Difference]: With dead ends: 1118 [2025-02-06 03:36:35,281 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 03:36:35,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:36:35,282 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 149 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:35,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 881 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 03:36:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 487. [2025-02-06 03:36:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 410 states have (on average 1.1170731707317074) internal successors, (458), 413 states have internal predecessors, (458), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 562 transitions. [2025-02-06 03:36:35,364 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 562 transitions. Word has length 129 [2025-02-06 03:36:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:35,364 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 562 transitions. [2025-02-06 03:36:35,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 562 transitions. [2025-02-06 03:36:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:35,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:35,365 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:35,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:36:35,366 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:35,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1554285325, now seen corresponding path program 1 times [2025-02-06 03:36:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688229008] [2025-02-06 03:36:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:35,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:35,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:35,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:35,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688229008] [2025-02-06 03:36:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688229008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:35,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:36:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549641543] [2025-02-06 03:36:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:35,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:36:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:35,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:36:35,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:36:35,547 INFO L87 Difference]: Start difference. First operand 487 states and 562 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:35,917 INFO L93 Difference]: Finished difference Result 1142 states and 1310 transitions. [2025-02-06 03:36:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:36:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-02-06 03:36:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:35,920 INFO L225 Difference]: With dead ends: 1142 [2025-02-06 03:36:35,920 INFO L226 Difference]: Without dead ends: 658 [2025-02-06 03:36:35,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:36:35,921 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 250 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:35,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 513 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-02-06 03:36:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 487. [2025-02-06 03:36:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 410 states have (on average 1.1146341463414635) internal successors, (457), 413 states have internal predecessors, (457), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 561 transitions. [2025-02-06 03:36:35,995 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 561 transitions. Word has length 129 [2025-02-06 03:36:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:35,996 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 561 transitions. [2025-02-06 03:36:35,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 561 transitions. [2025-02-06 03:36:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:35,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:35,997 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:35,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:36:35,997 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:35,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:35,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1487278572, now seen corresponding path program 1 times [2025-02-06 03:36:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293282257] [2025-02-06 03:36:35,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:36,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:36,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:36,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:36,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293282257] [2025-02-06 03:36:36,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293282257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:36,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:36,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:36:36,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330206586] [2025-02-06 03:36:36,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:36,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:36:36,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:36,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:36:36,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:36:36,268 INFO L87 Difference]: Start difference. First operand 487 states and 561 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:36,697 INFO L93 Difference]: Finished difference Result 1106 states and 1269 transitions. [2025-02-06 03:36:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:36:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-02-06 03:36:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:36,700 INFO L225 Difference]: With dead ends: 1106 [2025-02-06 03:36:36,700 INFO L226 Difference]: Without dead ends: 622 [2025-02-06 03:36:36,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:36:36,702 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 157 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:36,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 755 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-02-06 03:36:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 481. [2025-02-06 03:36:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 404 states have (on average 1.108910891089109) internal successors, (448), 407 states have internal predecessors, (448), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 552 transitions. [2025-02-06 03:36:36,777 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 552 transitions. Word has length 129 [2025-02-06 03:36:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:36,778 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 552 transitions. [2025-02-06 03:36:36,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:36:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 552 transitions. [2025-02-06 03:36:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:36,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:36,779 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:36:36,779 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:36,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash -634983343, now seen corresponding path program 1 times [2025-02-06 03:36:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:36,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393149667] [2025-02-06 03:36:36,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:36,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:36,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:36,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:36,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393149667] [2025-02-06 03:36:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393149667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:37,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:37,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:36:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629488804] [2025-02-06 03:36:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:36:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:37,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:36:37,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:36:37,035 INFO L87 Difference]: Start difference. First operand 481 states and 552 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:37,479 INFO L93 Difference]: Finished difference Result 1130 states and 1290 transitions. [2025-02-06 03:36:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:36:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-02-06 03:36:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:37,482 INFO L225 Difference]: With dead ends: 1130 [2025-02-06 03:36:37,483 INFO L226 Difference]: Without dead ends: 652 [2025-02-06 03:36:37,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:36:37,485 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 236 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:37,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 605 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-06 03:36:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 481. [2025-02-06 03:36:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 404 states have (on average 1.1014851485148516) internal successors, (445), 407 states have internal predecessors, (445), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 549 transitions. [2025-02-06 03:36:37,584 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 549 transitions. Word has length 129 [2025-02-06 03:36:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:37,584 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 549 transitions. [2025-02-06 03:36:37,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 03:36:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 549 transitions. [2025-02-06 03:36:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:36:37,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:37,585 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:36:37,586 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:37,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash -831496848, now seen corresponding path program 1 times [2025-02-06 03:36:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:37,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620597775] [2025-02-06 03:36:37,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:37,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:36:37,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:36:37,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:37,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:37,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:37,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620597775] [2025-02-06 03:36:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620597775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:36:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047581725] [2025-02-06 03:36:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:36:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:37,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:36:37,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:36:37,968 INFO L87 Difference]: Start difference. First operand 481 states and 549 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:38,536 INFO L93 Difference]: Finished difference Result 1103 states and 1252 transitions. [2025-02-06 03:36:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:36:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-02-06 03:36:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:38,539 INFO L225 Difference]: With dead ends: 1103 [2025-02-06 03:36:38,539 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 03:36:38,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:36:38,540 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 70 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:38,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1983 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:36:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 03:36:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 460. [2025-02-06 03:36:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 383 states have (on average 1.0939947780678851) internal successors, (419), 386 states have internal predecessors, (419), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:36:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 523 transitions. [2025-02-06 03:36:38,618 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 523 transitions. Word has length 129 [2025-02-06 03:36:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:38,618 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 523 transitions. [2025-02-06 03:36:38,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 523 transitions. [2025-02-06 03:36:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:36:38,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:38,619 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:36:38,619 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1301876081, now seen corresponding path program 1 times [2025-02-06 03:36:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132626265] [2025-02-06 03:36:38,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:38,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:36:38,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:36:38,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:38,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132626265] [2025-02-06 03:36:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132626265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:36:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688546389] [2025-02-06 03:36:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:39,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:36:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:39,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:36:39,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:36:39,179 INFO L87 Difference]: Start difference. First operand 460 states and 523 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:39,656 INFO L93 Difference]: Finished difference Result 604 states and 679 transitions. [2025-02-06 03:36:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:36:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-02-06 03:36:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:39,659 INFO L225 Difference]: With dead ends: 604 [2025-02-06 03:36:39,659 INFO L226 Difference]: Without dead ends: 602 [2025-02-06 03:36:39,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:36:39,660 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 85 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:39,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1447 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:36:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-02-06 03:36:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 599. [2025-02-06 03:36:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 501 states have (on average 1.0838323353293413) internal successors, (543), 505 states have internal predecessors, (543), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:36:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 675 transitions. [2025-02-06 03:36:39,768 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 675 transitions. Word has length 132 [2025-02-06 03:36:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:39,768 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 675 transitions. [2025-02-06 03:36:39,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 675 transitions. [2025-02-06 03:36:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:36:39,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:39,769 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:36:39,769 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:39,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1185636752, now seen corresponding path program 1 times [2025-02-06 03:36:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828072463] [2025-02-06 03:36:39,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:39,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:36:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:36:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:39,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828072463] [2025-02-06 03:36:39,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828072463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:39,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:36:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642150360] [2025-02-06 03:36:39,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:39,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:36:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:39,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:36:39,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:36:39,920 INFO L87 Difference]: Start difference. First operand 599 states and 675 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:40,072 INFO L93 Difference]: Finished difference Result 1188 states and 1339 transitions. [2025-02-06 03:36:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:36:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-02-06 03:36:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:40,075 INFO L225 Difference]: With dead ends: 1188 [2025-02-06 03:36:40,075 INFO L226 Difference]: Without dead ends: 592 [2025-02-06 03:36:40,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:36:40,076 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:40,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 382 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:36:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-06 03:36:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-06 03:36:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 494 states have (on average 1.0809716599190284) internal successors, (534), 498 states have internal predecessors, (534), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:36:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 666 transitions. [2025-02-06 03:36:40,179 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 666 transitions. Word has length 132 [2025-02-06 03:36:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:40,180 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 666 transitions. [2025-02-06 03:36:40,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 666 transitions. [2025-02-06 03:36:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:36:40,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:40,181 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:36:40,181 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:40,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 915881872, now seen corresponding path program 1 times [2025-02-06 03:36:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783598574] [2025-02-06 03:36:40,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:40,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:36:40,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:36:40,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:40,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:40,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783598574] [2025-02-06 03:36:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783598574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:36:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898794532] [2025-02-06 03:36:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:40,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:36:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:40,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:36:40,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:36:40,296 INFO L87 Difference]: Start difference. First operand 592 states and 666 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:40,470 INFO L93 Difference]: Finished difference Result 1181 states and 1329 transitions. [2025-02-06 03:36:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:36:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-02-06 03:36:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:40,474 INFO L225 Difference]: With dead ends: 1181 [2025-02-06 03:36:40,474 INFO L226 Difference]: Without dead ends: 592 [2025-02-06 03:36:40,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:36:40,475 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 81 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:40,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 436 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:36:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-06 03:36:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-06 03:36:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 494 states have (on average 1.0789473684210527) internal successors, (533), 498 states have internal predecessors, (533), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:36:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 665 transitions. [2025-02-06 03:36:40,648 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 665 transitions. Word has length 132 [2025-02-06 03:36:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:40,648 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 665 transitions. [2025-02-06 03:36:40,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 665 transitions. [2025-02-06 03:36:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:36:40,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:36:40,649 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:36:40,649 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:36:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:36:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash -891572591, now seen corresponding path program 1 times [2025-02-06 03:36:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:36:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949270775] [2025-02-06 03:36:40,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:36:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:36:40,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:36:40,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:36:40,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:36:40,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:36:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:36:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:36:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949270775] [2025-02-06 03:36:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949270775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:36:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:36:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:36:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518367619] [2025-02-06 03:36:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:36:40,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:36:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:36:40,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:36:40,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:36:40,941 INFO L87 Difference]: Start difference. First operand 592 states and 665 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:36:41,218 INFO L93 Difference]: Finished difference Result 667 states and 759 transitions. [2025-02-06 03:36:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:36:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-02-06 03:36:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:36:41,219 INFO L225 Difference]: With dead ends: 667 [2025-02-06 03:36:41,219 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 03:36:41,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:36:41,220 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 98 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:36:41,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2197 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:36:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 03:36:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 03:36:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 03:36:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 03:36:41,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2025-02-06 03:36:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:36:41,222 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 03:36:41,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:36:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 03:36:41,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 03:36:41,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:36:41,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 03:36:41,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:36:41,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 03:36:55,813 WARN L286 SmtUtils]: Spent 14.54s on a formula simplification. DAG size of input: 222 DAG size of output: 216 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-06 03:37:12,854 WARN L286 SmtUtils]: Spent 16.96s on a formula simplification. DAG size of input: 152 DAG size of output: 148 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)