./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.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-62.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 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:42:36,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:42:36,858 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:42:36,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:42:36,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:42:36,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:42:36,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:42:36,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:42:36,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:42:36,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:42:36,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:42:36,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:42:36,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:42:36,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:42:36,888 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:42:36,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:42:36,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:42:36,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:42:36,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:42:36,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:42:36,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:42:36,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:42:36,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:42:36,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:42:36,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:42:36,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:42:36,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:42:36,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:42:36,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:42:36,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:42:36,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:42:36,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:42:36,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:42:36,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:42:36,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:42:36,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:42:36,893 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 -> 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc [2025-02-06 03:42:37,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:42:37,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:42:37,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:42:37,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:42:37,189 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:42:37,190 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-62.i [2025-02-06 03:42:38,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16ef5f2fd/5fe0692106ff4a60a9cf11650aa6fef9/FLAGbaa089fb5 [2025-02-06 03:42:38,759 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:42:38,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2025-02-06 03:42:38,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16ef5f2fd/5fe0692106ff4a60a9cf11650aa6fef9/FLAGbaa089fb5 [2025-02-06 03:42:38,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16ef5f2fd/5fe0692106ff4a60a9cf11650aa6fef9 [2025-02-06 03:42:38,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:42:38,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:42:38,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:42:38,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:42:38,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:42:38,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:42:38" (1/1) ... [2025-02-06 03:42:38,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384ee5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:38, skipping insertion in model container [2025-02-06 03:42:38,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:42:38" (1/1) ... [2025-02-06 03:42:38,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:42:38,943 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-62.i[916,929] [2025-02-06 03:42:38,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:42:38,996 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:42:39,004 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-62.i[916,929] [2025-02-06 03:42:39,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:42:39,052 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:42:39,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39 WrapperNode [2025-02-06 03:42:39,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:42:39,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:42:39,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:42:39,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:42:39,060 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:42:39" (1/1) ... [2025-02-06 03:42:39,072 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:42:39" (1/1) ... [2025-02-06 03:42:39,115 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 347 [2025-02-06 03:42:39,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:42:39,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:42:39,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:42:39,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:42:39,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,151 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2025-02-06 03:42:39,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:42:39,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:42:39,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:42:39,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:42:39,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (1/1) ... [2025-02-06 03:42:39,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:42:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:39,208 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:42:39,210 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:42:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:42:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:42:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:42:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:42:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:42:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:42:39,379 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:42:39,381 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:42:39,744 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem40#1;havoc property_#t~mem41#1;havoc property_#t~ite48#1;havoc property_#t~mem42#1;havoc property_#t~mem47#1;havoc property_#t~mem43#1;havoc property_#t~ite46#1;havoc property_#t~mem44#1;havoc property_#t~mem45#1;havoc property_#t~short49#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~ite59#1;havoc property_#t~mem52#1;havoc property_#t~ite58#1;havoc property_#t~mem53#1;havoc property_#t~mem54#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~short60#1;havoc property_#t~mem61#1;havoc property_#t~ite75#1;havoc property_#t~mem62#1;havoc property_#t~ite71#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite70#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short76#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short82#1; [2025-02-06 03:42:39,784 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-02-06 03:42:39,785 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:42:39,793 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:42:39,793 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:42:39,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:42:39 BoogieIcfgContainer [2025-02-06 03:42:39,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:42:39,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:42:39,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:42:39,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:42:39,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:42:38" (1/3) ... [2025-02-06 03:42:39,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52873075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:42:39, skipping insertion in model container [2025-02-06 03:42:39,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:39" (2/3) ... [2025-02-06 03:42:39,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52873075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:42:39, skipping insertion in model container [2025-02-06 03:42:39,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:42:39" (3/3) ... [2025-02-06 03:42:39,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2025-02-06 03:42:39,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:42:39,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-62.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:42:39,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:42:39,873 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;@d955c43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:42:39,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:42:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:42:39,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:39,886 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:39,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 796589395, now seen corresponding path program 1 times [2025-02-06 03:42:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985768912] [2025-02-06 03:42:39,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:39,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:42:40,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:42:40,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:40,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-06 03:42:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:40,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985768912] [2025-02-06 03:42:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985768912] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:40,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925258421] [2025-02-06 03:42:40,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:40,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:40,154 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:42:40,155 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:42:40,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:42:40,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:42:40,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:40,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:40,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:42:40,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-06 03:42:40,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:40,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925258421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:40,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:42:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585190124] [2025-02-06 03:42:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:40,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:42:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:40,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:42:40,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:42:40,443 INFO L87 Difference]: Start difference. First operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 03:42:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:40,468 INFO L93 Difference]: Finished difference Result 138 states and 207 transitions. [2025-02-06 03:42:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:42:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-02-06 03:42:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:40,477 INFO L225 Difference]: With dead ends: 138 [2025-02-06 03:42:40,477 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 03:42:40,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:42:40,483 INFO L435 NwaCegarLoop]: 97 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, 97 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:42:40,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 03:42:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 03:42:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2025-02-06 03:42:40,514 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2025-02-06 03:42:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:40,514 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2025-02-06 03:42:40,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 03:42:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2025-02-06 03:42:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:42:40,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:40,517 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:42:40,722 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:42:40,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:40,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1810307403, now seen corresponding path program 1 times [2025-02-06 03:42:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:40,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169097654] [2025-02-06 03:42:40,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:40,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:42:40,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:42:40,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169097654] [2025-02-06 03:42:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169097654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:42:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205538348] [2025-02-06 03:42:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:40,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:40,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:40,984 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:41,026 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2025-02-06 03:42:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:41,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-02-06 03:42:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:41,028 INFO L225 Difference]: With dead ends: 138 [2025-02-06 03:42:41,028 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 03:42:41,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:41,029 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:41,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 03:42:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-02-06 03:42:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-02-06 03:42:41,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2025-02-06 03:42:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:41,042 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-02-06 03:42:41,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-02-06 03:42:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:42:41,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:41,044 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:42:41,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:41,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1597156212, now seen corresponding path program 1 times [2025-02-06 03:42:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101962908] [2025-02-06 03:42:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:41,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:42:41,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:42:41,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101962908] [2025-02-06 03:42:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101962908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:41,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:41,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:42:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893116016] [2025-02-06 03:42:41,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:41,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:41,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:41,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:41,290 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:41,324 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2025-02-06 03:42:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-02-06 03:42:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:41,328 INFO L225 Difference]: With dead ends: 142 [2025-02-06 03:42:41,329 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 03:42:41,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:41,330 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:41,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 03:42:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-02-06 03:42:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-02-06 03:42:41,337 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2025-02-06 03:42:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:41,338 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-02-06 03:42:41,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-02-06 03:42:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:42:41,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:41,340 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:42:41,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:41,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1596232691, now seen corresponding path program 1 times [2025-02-06 03:42:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129925920] [2025-02-06 03:42:41,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:41,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:42:41,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:42:41,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:41,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129925920] [2025-02-06 03:42:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129925920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:42:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971216731] [2025-02-06 03:42:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:41,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:41,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:41,579 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:41,640 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2025-02-06 03:42:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-02-06 03:42:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:41,642 INFO L225 Difference]: With dead ends: 170 [2025-02-06 03:42:41,642 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:42:41,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:41,645 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 89 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:41,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 287 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:42:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2025-02-06 03:42:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2025-02-06 03:42:41,658 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 73 [2025-02-06 03:42:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:41,659 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2025-02-06 03:42:41,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2025-02-06 03:42:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 03:42:41,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:41,660 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:42:41,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1207500789, now seen corresponding path program 1 times [2025-02-06 03:42:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807028628] [2025-02-06 03:42:41,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:41,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 03:42:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 03:42:41,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:41,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807028628] [2025-02-06 03:42:41,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807028628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:41,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:41,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:41,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185098101] [2025-02-06 03:42:41,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:41,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:41,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:41,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:41,973 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:42,073 INFO L93 Difference]: Finished difference Result 216 states and 298 transitions. [2025-02-06 03:42:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-02-06 03:42:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:42,076 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:42:42,078 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 03:42:42,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:42:42,079 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 90 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:42,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 693 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 03:42:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 83. [2025-02-06 03:42:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-02-06 03:42:42,088 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 75 [2025-02-06 03:42:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:42,088 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-02-06 03:42:42,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-02-06 03:42:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 03:42:42,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:42,090 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:42,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:42:42,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:42,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1976622418, now seen corresponding path program 1 times [2025-02-06 03:42:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681505612] [2025-02-06 03:42:42,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:42,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 03:42:42,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 03:42:42,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:42,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681505612] [2025-02-06 03:42:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681505612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550195782] [2025-02-06 03:42:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:42,340 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:42,418 INFO L93 Difference]: Finished difference Result 198 states and 271 transitions. [2025-02-06 03:42:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:42,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-02-06 03:42:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:42,420 INFO L225 Difference]: With dead ends: 198 [2025-02-06 03:42:42,421 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:42:42,421 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:42:42,424 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:42,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 481 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:42:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. [2025-02-06 03:42:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-02-06 03:42:42,436 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 77 [2025-02-06 03:42:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:42,437 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-02-06 03:42:42,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-02-06 03:42:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 03:42:42,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:42,438 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:42:42,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1791990686, now seen corresponding path program 1 times [2025-02-06 03:42:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323210904] [2025-02-06 03:42:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:42,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 03:42:42,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 03:42:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323210904] [2025-02-06 03:42:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323210904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584367808] [2025-02-06 03:42:42,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:42,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:42,641 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:42:42,644 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:42:42,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 03:42:42,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 03:42:42,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:42,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:42,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:42:42,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:42,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584367808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:42,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:42:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589769107] [2025-02-06 03:42:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:42,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:42,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:42,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:42,871 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:42,907 INFO L93 Difference]: Finished difference Result 166 states and 227 transitions. [2025-02-06 03:42:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-02-06 03:42:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:42,909 INFO L225 Difference]: With dead ends: 166 [2025-02-06 03:42:42,909 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 03:42:42,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 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:42:42,910 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:42,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 03:42:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 03:42:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2025-02-06 03:42:42,927 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 77 [2025-02-06 03:42:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:42,928 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2025-02-06 03:42:42,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2025-02-06 03:42:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 03:42:42,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:42,929 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:42,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:42:43,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:43,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2110753112, now seen corresponding path program 1 times [2025-02-06 03:42:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:43,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870182333] [2025-02-06 03:42:43,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:43,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 03:42:43,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 03:42:43,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:43,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870182333] [2025-02-06 03:42:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870182333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:43,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809889675] [2025-02-06 03:42:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:43,361 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:43,424 INFO L93 Difference]: Finished difference Result 202 states and 271 transitions. [2025-02-06 03:42:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-02-06 03:42:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:43,426 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:42:43,426 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:42:43,426 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:42:43,427 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 46 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:43,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 367 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:42:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2025-02-06 03:42:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 03:42:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2025-02-06 03:42:43,433 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 77 [2025-02-06 03:42:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:43,437 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2025-02-06 03:42:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2025-02-06 03:42:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 03:42:43,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:43,439 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:42:43,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1792703627, now seen corresponding path program 1 times [2025-02-06 03:42:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389134076] [2025-02-06 03:42:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:43,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 03:42:43,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 03:42:43,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:43,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389134076] [2025-02-06 03:42:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389134076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719964153] [2025-02-06 03:42:44,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:44,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:44,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:44,029 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:42:44,032 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:42:44,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 03:42:44,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 03:42:44,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:44,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:44,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:42:44,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:44,431 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:42:44,515 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 17 treesize of output 9 [2025-02-06 03:42:44,520 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 15 treesize of output 7 [2025-02-06 03:42:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:42:44,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:44,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 03:42:44,774 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 32 treesize of output 28 [2025-02-06 03:42:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:44,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719964153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:42:44,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:42:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2025-02-06 03:42:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347359238] [2025-02-06 03:42:44,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:42:44,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 03:42:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:44,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 03:42:44,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:42:44,867 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 21 states, 19 states have (on average 3.789473684210526) internal successors, (72), 21 states have internal predecessors, (72), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:42:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:45,807 INFO L93 Difference]: Finished difference Result 308 states and 404 transitions. [2025-02-06 03:42:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 03:42:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.789473684210526) internal successors, (72), 21 states have internal predecessors, (72), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 79 [2025-02-06 03:42:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:45,810 INFO L225 Difference]: With dead ends: 308 [2025-02-06 03:42:45,810 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 03:42:45,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 03:42:45,815 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 563 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:45,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1141 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:42:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 03:42:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 213. [2025-02-06 03:42:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 194 states have internal predecessors, (247), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:42:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 279 transitions. [2025-02-06 03:42:45,836 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 279 transitions. Word has length 79 [2025-02-06 03:42:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:45,837 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 279 transitions. [2025-02-06 03:42:45,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.789473684210526) internal successors, (72), 21 states have internal predecessors, (72), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 03:42:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 279 transitions. [2025-02-06 03:42:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:45,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:45,839 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:45,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:46,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 542723288, now seen corresponding path program 1 times [2025-02-06 03:42:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851224108] [2025-02-06 03:42:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:46,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:46,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:46,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:46,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:46,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851224108] [2025-02-06 03:42:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851224108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777770316] [2025-02-06 03:42:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:46,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:46,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:46,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:46,176 INFO L87 Difference]: Start difference. First operand 213 states and 279 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:46,275 INFO L93 Difference]: Finished difference Result 481 states and 626 transitions. [2025-02-06 03:42:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:46,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-02-06 03:42:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:46,279 INFO L225 Difference]: With dead ends: 481 [2025-02-06 03:42:46,279 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 03:42:46,281 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:42:46,282 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 61 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:46,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 369 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 03:42:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 226. [2025-02-06 03:42:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 204 states have (on average 1.2745098039215685) internal successors, (260), 206 states have internal predecessors, (260), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:42:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2025-02-06 03:42:46,299 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 80 [2025-02-06 03:42:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:46,299 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2025-02-06 03:42:46,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2025-02-06 03:42:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:46,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:46,301 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:42:46,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2050275097, now seen corresponding path program 1 times [2025-02-06 03:42:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156227338] [2025-02-06 03:42:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:46,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156227338] [2025-02-06 03:42:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156227338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123183828] [2025-02-06 03:42:46,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:46,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:46,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:46,872 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:42:46,874 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:42:46,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:47,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:47,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:47,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:47,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:42:47,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:47,211 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:42:47,376 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:42:47,542 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 15 treesize of output 7 [2025-02-06 03:42:47,548 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 15 treesize of output 7 [2025-02-06 03:42:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:42:47,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:47,728 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 36 treesize of output 32 [2025-02-06 03:42:47,834 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 31 [2025-02-06 03:42:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123183828] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:42:47,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:42:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-02-06 03:42:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688875792] [2025-02-06 03:42:47,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:42:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:42:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:47,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:42:47,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:42:47,916 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand has 22 states, 19 states have (on average 4.684210526315789) internal successors, (89), 21 states have internal predecessors, (89), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2025-02-06 03:42:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:48,370 INFO L93 Difference]: Finished difference Result 457 states and 589 transitions. [2025-02-06 03:42:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:42:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.684210526315789) internal successors, (89), 21 states have internal predecessors, (89), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 80 [2025-02-06 03:42:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:48,372 INFO L225 Difference]: With dead ends: 457 [2025-02-06 03:42:48,372 INFO L226 Difference]: Without dead ends: 234 [2025-02-06 03:42:48,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:42:48,373 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 332 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:48,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 443 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:42:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-06 03:42:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2025-02-06 03:42:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 204 states have (on average 1.2647058823529411) internal successors, (258), 206 states have internal predecessors, (258), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:42:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2025-02-06 03:42:48,386 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 80 [2025-02-06 03:42:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:48,386 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2025-02-06 03:42:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.684210526315789) internal successors, (89), 21 states have internal predecessors, (89), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2025-02-06 03:42:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2025-02-06 03:42:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:48,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:48,388 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:48,396 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:42:48,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 03:42:48,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:48,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2093465877, now seen corresponding path program 1 times [2025-02-06 03:42:48,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906066563] [2025-02-06 03:42:48,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:48,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:48,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:48,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:48,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906066563] [2025-02-06 03:42:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906066563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115011455] [2025-02-06 03:42:49,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:49,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:49,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:49,468 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:42:49,470 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:42:49,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:49,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:49,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:49,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:49,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:42:49,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:49,692 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:42:49,839 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 65 treesize of output 53 [2025-02-06 03:42:49,898 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 59 treesize of output 39 [2025-02-06 03:42:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:49,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:50,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115011455] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:50,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:42:50,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17, 11] total 23 [2025-02-06 03:42:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454693617] [2025-02-06 03:42:50,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:50,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:42:50,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:50,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:42:50,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:42:50,221 INFO L87 Difference]: Start difference. First operand 226 states and 290 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:50,586 INFO L93 Difference]: Finished difference Result 465 states and 594 transitions. [2025-02-06 03:42:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:42:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-02-06 03:42:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:50,589 INFO L225 Difference]: With dead ends: 465 [2025-02-06 03:42:50,589 INFO L226 Difference]: Without dead ends: 242 [2025-02-06 03:42:50,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:42:50,590 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 60 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:50,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 879 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:42:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-06 03:42:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 230. [2025-02-06 03:42:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 208 states have (on average 1.2596153846153846) internal successors, (262), 210 states have internal predecessors, (262), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:42:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 294 transitions. [2025-02-06 03:42:50,609 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 294 transitions. Word has length 80 [2025-02-06 03:42:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:50,609 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 294 transitions. [2025-02-06 03:42:50,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 294 transitions. [2025-02-06 03:42:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:50,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:50,610 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,619 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:42:50,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 03:42:50,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash -693949610, now seen corresponding path program 1 times [2025-02-06 03:42:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:50,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512594334] [2025-02-06 03:42:50,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:50,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:50,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:50,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512594334] [2025-02-06 03:42:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512594334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455272103] [2025-02-06 03:42:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:50,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:50,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:50,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:50,939 INFO L87 Difference]: Start difference. First operand 230 states and 294 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:51,033 INFO L93 Difference]: Finished difference Result 456 states and 582 transitions. [2025-02-06 03:42:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:51,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-02-06 03:42:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:51,036 INFO L225 Difference]: With dead ends: 456 [2025-02-06 03:42:51,036 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 03:42:51,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:51,037 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:51,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 537 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 03:42:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-02-06 03:42:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 195 states have (on average 1.2512820512820513) internal successors, (244), 197 states have internal predecessors, (244), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:42:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2025-02-06 03:42:51,047 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 80 [2025-02-06 03:42:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2025-02-06 03:42:51,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2025-02-06 03:42:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:51,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:51,048 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:51,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:42:51,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash -956736938, now seen corresponding path program 1 times [2025-02-06 03:42:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457235575] [2025-02-06 03:42:51,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:51,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:51,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:51,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457235575] [2025-02-06 03:42:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457235575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950607162] [2025-02-06 03:42:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:51,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:51,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:51,154 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:51,253 INFO L93 Difference]: Finished difference Result 472 states and 600 transitions. [2025-02-06 03:42:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:42:51,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-02-06 03:42:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:51,255 INFO L225 Difference]: With dead ends: 472 [2025-02-06 03:42:51,255 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:42:51,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:51,257 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 61 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:51,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 554 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:42:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 217. [2025-02-06 03:42:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 195 states have (on average 1.2461538461538462) internal successors, (243), 197 states have internal predecessors, (243), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:42:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2025-02-06 03:42:51,276 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 80 [2025-02-06 03:42:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:51,276 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-02-06 03:42:51,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2025-02-06 03:42:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:51,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:51,278 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:51,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:42:51,278 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:51,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash 550814871, now seen corresponding path program 1 times [2025-02-06 03:42:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854130679] [2025-02-06 03:42:51,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:51,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:51,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:51,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854130679] [2025-02-06 03:42:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854130679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:42:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890646506] [2025-02-06 03:42:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:52,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:42:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:52,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:42:52,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:42:52,326 INFO L87 Difference]: Start difference. First operand 217 states and 275 transitions. Second operand has 18 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 03:42:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:53,392 INFO L93 Difference]: Finished difference Result 880 states and 1104 transitions. [2025-02-06 03:42:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:42:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2025-02-06 03:42:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:53,396 INFO L225 Difference]: With dead ends: 880 [2025-02-06 03:42:53,398 INFO L226 Difference]: Without dead ends: 666 [2025-02-06 03:42:53,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:42:53,401 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 773 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:53,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1268 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:42:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-02-06 03:42:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 395. [2025-02-06 03:42:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 354 states have (on average 1.2401129943502824) internal successors, (439), 357 states have internal predecessors, (439), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:42:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 499 transitions. [2025-02-06 03:42:53,438 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 499 transitions. Word has length 80 [2025-02-06 03:42:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 499 transitions. [2025-02-06 03:42:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 03:42:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 499 transitions. [2025-02-06 03:42:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:53,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:53,441 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:42:53,442 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1952889544, now seen corresponding path program 1 times [2025-02-06 03:42:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792909226] [2025-02-06 03:42:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:53,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:53,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:53,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:53,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792909226] [2025-02-06 03:42:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792909226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582826810] [2025-02-06 03:42:53,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:53,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:53,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:53,571 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:42:53,573 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:42:53,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:53,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:53,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:53,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:53,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:42:53,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:53,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582826810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:53,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:42:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45951631] [2025-02-06 03:42:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:53,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:53,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:53,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:42:53,753 INFO L87 Difference]: Start difference. First operand 395 states and 499 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:53,800 INFO L93 Difference]: Finished difference Result 807 states and 1020 transitions. [2025-02-06 03:42:53,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:53,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-02-06 03:42:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:53,806 INFO L225 Difference]: With dead ends: 807 [2025-02-06 03:42:53,806 INFO L226 Difference]: Without dead ends: 415 [2025-02-06 03:42:53,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:42:53,808 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:53,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-06 03:42:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 400. [2025-02-06 03:42:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 359 states have (on average 1.2367688022284122) internal successors, (444), 362 states have internal predecessors, (444), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:42:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 504 transitions. [2025-02-06 03:42:53,839 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 504 transitions. Word has length 80 [2025-02-06 03:42:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:53,839 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 504 transitions. [2025-02-06 03:42:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 504 transitions. [2025-02-06 03:42:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:42:53,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:53,841 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,849 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:42:54,041 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,SelfDestructingSolverStorable15 [2025-02-06 03:42:54,042 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 735479975, now seen corresponding path program 1 times [2025-02-06 03:42:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965891133] [2025-02-06 03:42:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:54,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:42:54,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:42:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965891133] [2025-02-06 03:42:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965891133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:54,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487411417] [2025-02-06 03:42:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:54,174 INFO L87 Difference]: Start difference. First operand 400 states and 504 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:54,271 INFO L93 Difference]: Finished difference Result 801 states and 1008 transitions. [2025-02-06 03:42:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:54,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-02-06 03:42:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:54,274 INFO L225 Difference]: With dead ends: 801 [2025-02-06 03:42:54,275 INFO L226 Difference]: Without dead ends: 404 [2025-02-06 03:42:54,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:54,276 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 53 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:54,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-06 03:42:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 359. [2025-02-06 03:42:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 320 states have (on average 1.221875) internal successors, (391), 322 states have internal predecessors, (391), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:42:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 447 transitions. [2025-02-06 03:42:54,301 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 447 transitions. Word has length 80 [2025-02-06 03:42:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:54,302 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 447 transitions. [2025-02-06 03:42:54,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 447 transitions. [2025-02-06 03:42:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 03:42:54,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:54,303 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:54,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:42:54,303 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:54,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash -788634455, now seen corresponding path program 1 times [2025-02-06 03:42:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:54,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467081610] [2025-02-06 03:42:54,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:54,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 03:42:54,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 03:42:54,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:54,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 03:42:55,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:55,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467081610] [2025-02-06 03:42:55,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467081610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:55,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744673645] [2025-02-06 03:42:55,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:55,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:55,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:55,090 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:42:55,092 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:42:55,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 03:42:55,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 03:42:55,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:55,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:55,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:42:55,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:55,332 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:42:55,385 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:42:55,504 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 57 treesize of output 45 [2025-02-06 03:42:55,560 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:42:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 03:42:55,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744673645] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:55,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:42:55,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 10] total 24 [2025-02-06 03:42:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647058445] [2025-02-06 03:42:55,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:55,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:42:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:55,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:42:55,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:42:55,862 INFO L87 Difference]: Start difference. First operand 359 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:56,216 INFO L93 Difference]: Finished difference Result 885 states and 1100 transitions. [2025-02-06 03:42:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:42:56,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2025-02-06 03:42:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:56,220 INFO L225 Difference]: With dead ends: 885 [2025-02-06 03:42:56,220 INFO L226 Difference]: Without dead ends: 529 [2025-02-06 03:42:56,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:42:56,222 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:56,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 942 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-06 03:42:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 175. [2025-02-06 03:42:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 156 states have internal predecessors, (189), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:42:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 217 transitions. [2025-02-06 03:42:56,237 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 217 transitions. Word has length 81 [2025-02-06 03:42:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:56,238 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 217 transitions. [2025-02-06 03:42:56,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 217 transitions. [2025-02-06 03:42:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 03:42:56,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:56,239 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:56,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:56,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:56,440 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:56,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -858535626, now seen corresponding path program 1 times [2025-02-06 03:42:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321469619] [2025-02-06 03:42:56,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:56,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 03:42:56,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 03:42:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:56,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321469619] [2025-02-06 03:42:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321469619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648747679] [2025-02-06 03:42:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:56,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:56,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:56,544 INFO L87 Difference]: Start difference. First operand 175 states and 217 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:56,595 INFO L93 Difference]: Finished difference Result 419 states and 520 transitions. [2025-02-06 03:42:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-02-06 03:42:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:56,598 INFO L225 Difference]: With dead ends: 419 [2025-02-06 03:42:56,598 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 03:42:56,598 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:42:56,599 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:56,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 325 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 03:42:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 175. [2025-02-06 03:42:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 155 states have (on average 1.206451612903226) internal successors, (187), 156 states have internal predecessors, (187), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:42:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 215 transitions. [2025-02-06 03:42:56,611 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 215 transitions. Word has length 82 [2025-02-06 03:42:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:56,611 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 215 transitions. [2025-02-06 03:42:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 215 transitions. [2025-02-06 03:42:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 03:42:56,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:56,613 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:42:56,613 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:56,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1378705283, now seen corresponding path program 1 times [2025-02-06 03:42:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208967671] [2025-02-06 03:42:56,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:56,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 03:42:56,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 03:42:56,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:56,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208967671] [2025-02-06 03:42:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208967671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:56,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:42:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775480732] [2025-02-06 03:42:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:56,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:42:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:56,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:42:56,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:42:56,921 INFO L87 Difference]: Start difference. First operand 175 states and 215 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 03:42:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:57,212 INFO L93 Difference]: Finished difference Result 477 states and 580 transitions. [2025-02-06 03:42:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:42:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2025-02-06 03:42:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:57,214 INFO L225 Difference]: With dead ends: 477 [2025-02-06 03:42:57,214 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 03:42:57,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:42:57,215 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 280 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:57,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 578 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:42:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 03:42:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2025-02-06 03:42:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.1897233201581028) internal successors, (301), 256 states have internal predecessors, (301), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:42:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 345 transitions. [2025-02-06 03:42:57,237 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 345 transitions. Word has length 83 [2025-02-06 03:42:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:57,238 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 345 transitions. [2025-02-06 03:42:57,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 03:42:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 345 transitions. [2025-02-06 03:42:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 03:42:57,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:57,239 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:42:57,239 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:57,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1622723162, now seen corresponding path program 1 times [2025-02-06 03:42:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:57,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493865137] [2025-02-06 03:42:57,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 03:42:57,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 03:42:57,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:57,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:57,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493865137] [2025-02-06 03:42:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493865137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157579496] [2025-02-06 03:42:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:57,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:57,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:57,350 INFO L87 Difference]: Start difference. First operand 285 states and 345 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:57,414 INFO L93 Difference]: Finished difference Result 699 states and 852 transitions. [2025-02-06 03:42:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2025-02-06 03:42:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:57,417 INFO L225 Difference]: With dead ends: 699 [2025-02-06 03:42:57,418 INFO L226 Difference]: Without dead ends: 417 [2025-02-06 03:42:57,418 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:42:57,419 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:57,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 324 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-06 03:42:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 305. [2025-02-06 03:42:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 273 states have (on average 1.1758241758241759) internal successors, (321), 276 states have internal predecessors, (321), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:42:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 365 transitions. [2025-02-06 03:42:57,456 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 365 transitions. Word has length 83 [2025-02-06 03:42:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:57,456 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 365 transitions. [2025-02-06 03:42:57,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 365 transitions. [2025-02-06 03:42:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 03:42:57,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:57,457 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:42:57,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:57,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1671497532, now seen corresponding path program 1 times [2025-02-06 03:42:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661967034] [2025-02-06 03:42:57,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:57,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 03:42:57,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 03:42:57,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:57,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661967034] [2025-02-06 03:42:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661967034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:57,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268829714] [2025-02-06 03:42:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:57,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:57,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:57,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:57,530 INFO L87 Difference]: Start difference. First operand 305 states and 365 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:57,630 INFO L93 Difference]: Finished difference Result 697 states and 834 transitions. [2025-02-06 03:42:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2025-02-06 03:42:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:57,633 INFO L225 Difference]: With dead ends: 697 [2025-02-06 03:42:57,633 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 03:42:57,633 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:42:57,636 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 43 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:57,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 432 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 03:42:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 331. [2025-02-06 03:42:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 302 states have internal predecessors, (349), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:42:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 393 transitions. [2025-02-06 03:42:57,658 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 393 transitions. Word has length 83 [2025-02-06 03:42:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:57,658 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 393 transitions. [2025-02-06 03:42:57,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 393 transitions. [2025-02-06 03:42:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 03:42:57,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:57,660 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:42:57,660 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:57,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1297475480, now seen corresponding path program 1 times [2025-02-06 03:42:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143034999] [2025-02-06 03:42:57,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:57,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 03:42:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 03:42:57,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:57,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143034999] [2025-02-06 03:42:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143034999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:58,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:58,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533058008] [2025-02-06 03:42:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:58,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:58,113 INFO L87 Difference]: Start difference. First operand 331 states and 393 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:58,248 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2025-02-06 03:42:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-02-06 03:42:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:58,252 INFO L225 Difference]: With dead ends: 387 [2025-02-06 03:42:58,252 INFO L226 Difference]: Without dead ends: 385 [2025-02-06 03:42:58,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:42:58,253 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 64 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:58,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 491 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-06 03:42:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 380. [2025-02-06 03:42:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 335 states have (on average 1.1492537313432836) internal successors, (385), 339 states have internal predecessors, (385), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:42:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 445 transitions. [2025-02-06 03:42:58,303 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 445 transitions. Word has length 85 [2025-02-06 03:42:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:58,304 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 445 transitions. [2025-02-06 03:42:58,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 445 transitions. [2025-02-06 03:42:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 03:42:58,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:58,305 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:42:58,305 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1298399001, now seen corresponding path program 1 times [2025-02-06 03:42:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:58,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631135630] [2025-02-06 03:42:58,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:58,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 03:42:58,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 03:42:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631135630] [2025-02-06 03:42:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631135630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:58,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:58,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:58,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320683756] [2025-02-06 03:42:58,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:58,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:58,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:58,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:58,462 INFO L87 Difference]: Start difference. First operand 380 states and 445 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:58,553 INFO L93 Difference]: Finished difference Result 724 states and 850 transitions. [2025-02-06 03:42:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-02-06 03:42:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:58,556 INFO L225 Difference]: With dead ends: 724 [2025-02-06 03:42:58,556 INFO L226 Difference]: Without dead ends: 384 [2025-02-06 03:42:58,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:58,558 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:58,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 358 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-06 03:42:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 221. [2025-02-06 03:42:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.1398963730569949) internal successors, (220), 195 states have internal predecessors, (220), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 256 transitions. [2025-02-06 03:42:58,587 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 256 transitions. Word has length 85 [2025-02-06 03:42:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 256 transitions. [2025-02-06 03:42:58,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 256 transitions. [2025-02-06 03:42:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 03:42:58,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:58,588 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:42:58,589 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:58,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2109064614, now seen corresponding path program 1 times [2025-02-06 03:42:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:58,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054272518] [2025-02-06 03:42:58,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:58,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 03:42:58,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 03:42:58,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:58,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054272518] [2025-02-06 03:42:58,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054272518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:58,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:58,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085844553] [2025-02-06 03:42:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:58,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:58,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:58,870 INFO L87 Difference]: Start difference. First operand 221 states and 256 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:58,994 INFO L93 Difference]: Finished difference Result 540 states and 628 transitions. [2025-02-06 03:42:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-02-06 03:42:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:58,996 INFO L225 Difference]: With dead ends: 540 [2025-02-06 03:42:58,996 INFO L226 Difference]: Without dead ends: 347 [2025-02-06 03:42:58,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:42:58,997 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 37 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:58,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 384 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-06 03:42:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 305. [2025-02-06 03:42:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.1407942238267148) internal successors, (316), 279 states have internal predecessors, (316), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 352 transitions. [2025-02-06 03:42:59,028 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 352 transitions. Word has length 85 [2025-02-06 03:42:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 352 transitions. [2025-02-06 03:42:59,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 352 transitions. [2025-02-06 03:42:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 03:42:59,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:59,031 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:42:59,032 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1299644720, now seen corresponding path program 1 times [2025-02-06 03:42:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633821176] [2025-02-06 03:42:59,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:59,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 03:42:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 03:42:59,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:59,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:59,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633821176] [2025-02-06 03:42:59,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633821176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:59,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:59,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270605083] [2025-02-06 03:42:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:59,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:59,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:59,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:59,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:59,151 INFO L87 Difference]: Start difference. First operand 305 states and 352 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:59,225 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2025-02-06 03:42:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 86 [2025-02-06 03:42:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:59,228 INFO L225 Difference]: With dead ends: 636 [2025-02-06 03:42:59,228 INFO L226 Difference]: Without dead ends: 359 [2025-02-06 03:42:59,229 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:42:59,229 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 33 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:59,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 418 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-06 03:42:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 267. [2025-02-06 03:42:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.1213389121338913) internal successors, (268), 241 states have internal predecessors, (268), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 304 transitions. [2025-02-06 03:42:59,256 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 304 transitions. Word has length 86 [2025-02-06 03:42:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:59,256 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 304 transitions. [2025-02-06 03:42:59,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 304 transitions. [2025-02-06 03:42:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 03:42:59,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:59,258 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:42:59,258 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:59,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1440258089, now seen corresponding path program 1 times [2025-02-06 03:42:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524934125] [2025-02-06 03:42:59,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:59,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 03:42:59,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 03:42:59,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:59,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524934125] [2025-02-06 03:42:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524934125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:59,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:59,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:42:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593429958] [2025-02-06 03:42:59,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:59,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:59,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:59,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:59,334 INFO L87 Difference]: Start difference. First operand 267 states and 304 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:59,391 INFO L93 Difference]: Finished difference Result 443 states and 506 transitions. [2025-02-06 03:42:59,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:59,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2025-02-06 03:42:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:59,393 INFO L225 Difference]: With dead ends: 443 [2025-02-06 03:42:59,394 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 03:42:59,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:42:59,394 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:59,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 03:42:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 03:42:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2025-02-06 03:42:59,422 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 87 [2025-02-06 03:42:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:59,423 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2025-02-06 03:42:59,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2025-02-06 03:42:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 03:42:59,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:59,425 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:42:59,425 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:59,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 664147580, now seen corresponding path program 1 times [2025-02-06 03:42:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230119476] [2025-02-06 03:42:59,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:59,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 03:42:59,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 03:42:59,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:59,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:42:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230119476] [2025-02-06 03:42:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230119476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:59,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:59,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774167129] [2025-02-06 03:42:59,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:59,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:59,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:59,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:59,524 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:59,614 INFO L93 Difference]: Finished difference Result 459 states and 518 transitions. [2025-02-06 03:42:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:59,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2025-02-06 03:42:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:59,617 INFO L225 Difference]: With dead ends: 459 [2025-02-06 03:42:59,617 INFO L226 Difference]: Without dead ends: 283 [2025-02-06 03:42:59,617 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:42:59,618 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:59,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 273 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-06 03:42:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2025-02-06 03:42:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 235 states have (on average 1.102127659574468) internal successors, (259), 237 states have internal predecessors, (259), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2025-02-06 03:42:59,646 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 87 [2025-02-06 03:42:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2025-02-06 03:42:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:42:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2025-02-06 03:42:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 03:42:59,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:59,647 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:42:59,648 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:59,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1322410454, now seen corresponding path program 1 times [2025-02-06 03:42:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:59,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949583159] [2025-02-06 03:42:59,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:59,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 03:42:59,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 03:42:59,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:59,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:43:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949583159] [2025-02-06 03:43:00,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949583159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:00,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:00,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:43:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687868548] [2025-02-06 03:43:00,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:00,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:43:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:00,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:43:00,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:43:00,056 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 03:43:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:00,245 INFO L93 Difference]: Finished difference Result 506 states and 569 transitions. [2025-02-06 03:43:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:43:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2025-02-06 03:43:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:00,248 INFO L225 Difference]: With dead ends: 506 [2025-02-06 03:43:00,248 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 03:43:00,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:43:00,253 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 113 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:00,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 360 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 03:43:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2025-02-06 03:43:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 237 states have (on average 1.1012658227848102) internal successors, (261), 239 states have internal predecessors, (261), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:43:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 297 transitions. [2025-02-06 03:43:00,281 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 297 transitions. Word has length 88 [2025-02-06 03:43:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:00,282 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 297 transitions. [2025-02-06 03:43:00,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 03:43:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 297 transitions. [2025-02-06 03:43:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 03:43:00,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:00,283 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:00,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:43:00,283 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:00,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681267, now seen corresponding path program 1 times [2025-02-06 03:43:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:00,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050018355] [2025-02-06 03:43:00,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 03:43:00,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 03:43:00,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:43:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050018355] [2025-02-06 03:43:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050018355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:00,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949904523] [2025-02-06 03:43:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:00,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:00,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:00,373 INFO L87 Difference]: Start difference. First operand 265 states and 297 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:43:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:00,470 INFO L93 Difference]: Finished difference Result 498 states and 554 transitions. [2025-02-06 03:43:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 90 [2025-02-06 03:43:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:00,471 INFO L225 Difference]: With dead ends: 498 [2025-02-06 03:43:00,471 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 03:43:00,472 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:43:00,472 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:00,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 354 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 03:43:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 03:43:00,472 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:43:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 03:43:00,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2025-02-06 03:43:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:00,473 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 03:43:00,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 03:43:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 03:43:00,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 03:43:00,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:43:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:43:00,481 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] [2025-02-06 03:43:00,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 03:43:17,508 WARN L286 SmtUtils]: Spent 15.24s on a formula simplification. DAG size of input: 209 DAG size of output: 204 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-06 03:43:21,076 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:43:21,088 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:43:21,091 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:43:21,091 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-02-06 03:43:21,093 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2025-02-06 03:43:21,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2025-02-06 03:43:21,095 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,096 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-02-06 03:43:21,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-02-06 03:43:21,098 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2025-02-06 03:43:21,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2025-02-06 03:43:21,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:43:21 BoogieIcfgContainer [2025-02-06 03:43:21,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:43:21,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:43:21,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:43:21,102 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:43:21,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:42:39" (3/4) ... [2025-02-06 03:43:21,104 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 03:43:21,110 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 03:43:21,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 03:43:21,119 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 03:43:21,119 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 03:43:21,120 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 03:43:21,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 03:43:21,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 03:43:21,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:43:21,230 INFO L158 Benchmark]: Toolchain (without parser) took 42444.00ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 113.2MB in the beginning and 798.2MB in the end (delta: -685.0MB). Peak memory consumption was 441.8MB. Max. memory is 16.1GB. [2025-02-06 03:43:21,231 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:43:21,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.67ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 100.0MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:43:21,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.19ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:43:21,231 INFO L158 Benchmark]: Boogie Preprocessor took 54.77ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:43:21,231 INFO L158 Benchmark]: IcfgBuilder took 618.04ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 68.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:43:21,233 INFO L158 Benchmark]: TraceAbstraction took 41304.79ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 67.0MB in the beginning and 810.6MB in the end (delta: -743.6MB). Peak memory consumption was 722.1MB. Max. memory is 16.1GB. [2025-02-06 03:43:21,233 INFO L158 Benchmark]: Witness Printer took 128.56ms. Allocated memory is still 1.3GB. Free memory was 810.6MB in the beginning and 798.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:43:21,234 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.67ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 100.0MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.19ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.77ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 618.04ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 68.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41304.79ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 67.0MB in the beginning and 810.6MB in the end (delta: -743.6MB). Peak memory consumption was 722.1MB. Max. memory is 16.1GB. * Witness Printer took 128.56ms. Allocated memory is still 1.3GB. Free memory was 810.6MB in the beginning and 798.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 30, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3033 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3033 mSDsluCounter, 14243 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11100 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3625 IncrementalHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 3143 mSDtfsCounter, 3625 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1193 GetRequests, 899 SyntacticMatches, 1 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=16, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 1562 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2972 NumberOfCodeBlocks, 2972 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3251 ConstructedInterpolants, 0 QuantifiedInterpolants, 12477 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 41 InterpolantComputations, 28 PerfectInterpolantSequences, 4282/4592 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 03:43:21,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE