./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.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-a_file-34.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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:14:34,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:14:34,844 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:14:34,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:14:34,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:14:34,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:14:34,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:14:34,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:14:34,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:14:34,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:14:34,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:14:34,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:14:34,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:14:34,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:14:34,874 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:14:34,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:14:34,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:14:34,874 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:14:34,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:14:34,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:14:34,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:14:34,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:34,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:14:34,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:14:34,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:14:34,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:14:34,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:14:34,877 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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2025-02-06 03:14:35,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:14:35,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:14:35,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:14:35,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:14:35,132 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:14:35,133 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-a_file-34.i [2025-02-06 03:14:36,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b39acefdd/53b7fc2644624f31b653ca7c82003f2e/FLAG786c2c334 [2025-02-06 03:14:36,619 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:14:36,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2025-02-06 03:14:36,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b39acefdd/53b7fc2644624f31b653ca7c82003f2e/FLAG786c2c334 [2025-02-06 03:14:36,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b39acefdd/53b7fc2644624f31b653ca7c82003f2e [2025-02-06 03:14:36,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:14:36,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:14:36,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:36,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:14:36,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:14:36,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36, skipping insertion in model container [2025-02-06 03:14:36,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:14:36,751 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-a_file-34.i[916,929] [2025-02-06 03:14:36,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:36,788 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:14:36,794 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-a_file-34.i[916,929] [2025-02-06 03:14:36,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:36,825 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:14:36,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36 WrapperNode [2025-02-06 03:14:36,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:36,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:36,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:14:36,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:14:36,830 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:14:36" (1/1) ... [2025-02-06 03:14:36,837 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:14:36" (1/1) ... [2025-02-06 03:14:36,859 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2025-02-06 03:14:36,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:36,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:14:36,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:14:36,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:14:36,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,880 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2025-02-06 03:14:36,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:14:36,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:14:36,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:14:36,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:14:36,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (1/1) ... [2025-02-06 03:14:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:36,930 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:14:36,941 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:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:14:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:14:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:14:36,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:14:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:14:36,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:14:37,036 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:14:37,038 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:14:37,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~short89#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~ite110#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short118#1; [2025-02-06 03:14:37,392 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 03:14:37,393 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:14:37,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:14:37,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:14:37,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:37 BoogieIcfgContainer [2025-02-06 03:14:37,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:14:37,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:14:37,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:14:37,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:14:37,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:14:36" (1/3) ... [2025-02-06 03:14:37,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36283828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:37, skipping insertion in model container [2025-02-06 03:14:37,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:36" (2/3) ... [2025-02-06 03:14:37,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36283828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:37, skipping insertion in model container [2025-02-06 03:14:37,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:37" (3/3) ... [2025-02-06 03:14:37,415 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2025-02-06 03:14:37,426 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:14:37,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:14:37,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:14:37,488 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;@2ad2bf4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:14:37,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:14:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 03:14:37,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:37,506 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:37,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:37,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 855180355, now seen corresponding path program 1 times [2025-02-06 03:14:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:37,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252444554] [2025-02-06 03:14:37,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:37,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 03:14:37,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 03:14:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 03:14:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252444554] [2025-02-06 03:14:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252444554] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446559392] [2025-02-06 03:14:37,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:37,737 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:14:37,739 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:14:37,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 03:14:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 03:14:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:37,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:14:37,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 03:14:37,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:37,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446559392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:37,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:37,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:14:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870955249] [2025-02-06 03:14:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:14:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:37,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:14:37,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:14:37,965 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:37,994 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-02-06 03:14:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:14:37,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-02-06 03:14:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:38,004 INFO L225 Difference]: With dead ends: 232 [2025-02-06 03:14:38,004 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 03:14:38,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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:14:38,007 INFO L435 NwaCegarLoop]: 168 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, 168 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:14:38,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 03:14:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 03:14:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-02-06 03:14:38,032 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-02-06 03:14:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:38,032 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-02-06 03:14:38,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-02-06 03:14:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 03:14:38,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:38,035 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:38,041 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:14:38,239 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:14:38,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:38,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2030050746, now seen corresponding path program 1 times [2025-02-06 03:14:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:38,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419218940] [2025-02-06 03:14:38,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:38,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:38,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 03:14:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 03:14:38,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:38,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:14:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419218940] [2025-02-06 03:14:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419218940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83818045] [2025-02-06 03:14:38,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:38,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:38,758 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:14:38,760 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:14:38,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 03:14:38,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 03:14:38,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:38,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:38,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:14:38,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:38,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83818045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:14:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357928458] [2025-02-06 03:14:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:38,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:38,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:38,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:38,986 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:39,012 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2025-02-06 03:14:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-02-06 03:14:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:39,014 INFO L225 Difference]: With dead ends: 231 [2025-02-06 03:14:39,014 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:14:39,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:39,015 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:39,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:14:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:14:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-02-06 03:14:39,025 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2025-02-06 03:14:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-02-06 03:14:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-02-06 03:14:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 03:14:39,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:39,032 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:39,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:39,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:39,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2105828638, now seen corresponding path program 1 times [2025-02-06 03:14:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:39,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271293403] [2025-02-06 03:14:39,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:39,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 03:14:39,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 03:14:39,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:39,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:39,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271293403] [2025-02-06 03:14:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271293403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:39,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:39,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:14:39,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413428948] [2025-02-06 03:14:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:39,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:14:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:39,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:14:39,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:39,341 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:39,371 INFO L93 Difference]: Finished difference Result 282 states and 408 transitions. [2025-02-06 03:14:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:14:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-02-06 03:14:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:39,375 INFO L225 Difference]: With dead ends: 282 [2025-02-06 03:14:39,376 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 03:14:39,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:39,377 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:39,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 03:14:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2025-02-06 03:14:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2025-02-06 03:14:39,390 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 173 [2025-02-06 03:14:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:39,391 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2025-02-06 03:14:39,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2025-02-06 03:14:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 03:14:39,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:39,395 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:39,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:14:39,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:39,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2138667305, now seen corresponding path program 1 times [2025-02-06 03:14:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156537050] [2025-02-06 03:14:39,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 03:14:39,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 03:14:39,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:39,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156537050] [2025-02-06 03:14:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156537050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:14:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103989185] [2025-02-06 03:14:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:39,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:14:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:39,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:14:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:39,526 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:39,552 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2025-02-06 03:14:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:14:39,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-02-06 03:14:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:39,555 INFO L225 Difference]: With dead ends: 297 [2025-02-06 03:14:39,555 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 03:14:39,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:39,558 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 61 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:39,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 03:14:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2025-02-06 03:14:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-02-06 03:14:39,567 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 176 [2025-02-06 03:14:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:39,568 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-02-06 03:14:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-02-06 03:14:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 03:14:39,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:39,569 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:39,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:14:39,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:39,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1638320619, now seen corresponding path program 1 times [2025-02-06 03:14:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:39,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381629224] [2025-02-06 03:14:39,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:39,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 03:14:39,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 03:14:39,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:39,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:39,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381629224] [2025-02-06 03:14:39,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381629224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:39,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:39,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:14:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822914502] [2025-02-06 03:14:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:39,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:14:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:39,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:14:39,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:39,682 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:39,695 INFO L93 Difference]: Finished difference Result 270 states and 387 transitions. [2025-02-06 03:14:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:14:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-02-06 03:14:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:39,696 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:14:39,696 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 03:14:39,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:39,697 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:39,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 03:14:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 03:14:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 112 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2025-02-06 03:14:39,703 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 176 [2025-02-06 03:14:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:39,703 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2025-02-06 03:14:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2025-02-06 03:14:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 03:14:39,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:39,705 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:14:39,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1344917612, now seen corresponding path program 1 times [2025-02-06 03:14:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755314972] [2025-02-06 03:14:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:39,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 03:14:39,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 03:14:39,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:39,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755314972] [2025-02-06 03:14:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755314972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139047652] [2025-02-06 03:14:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:40,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:40,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:40,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:40,246 INFO L87 Difference]: Start difference. First operand 137 states and 195 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:14:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:40,457 INFO L93 Difference]: Finished difference Result 267 states and 381 transitions. [2025-02-06 03:14:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:40,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2025-02-06 03:14:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:40,459 INFO L225 Difference]: With dead ends: 267 [2025-02-06 03:14:40,459 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 03:14:40,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:14:40,460 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 206 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:40,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 374 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 03:14:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-06 03:14:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 108 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2025-02-06 03:14:40,476 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 176 [2025-02-06 03:14:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:40,477 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2025-02-06 03:14:40,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:14:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2025-02-06 03:14:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 03:14:40,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:40,479 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:40,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:14:40,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:40,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash -628241223, now seen corresponding path program 1 times [2025-02-06 03:14:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:40,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848813542] [2025-02-06 03:14:40,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:40,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:14:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:14:40,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:40,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:40,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:40,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848813542] [2025-02-06 03:14:40,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848813542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:40,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:40,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:14:40,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986863508] [2025-02-06 03:14:40,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:40,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:40,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:14:40,742 INFO L87 Difference]: Start difference. First operand 133 states and 187 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:40,849 INFO L93 Difference]: Finished difference Result 393 states and 554 transitions. [2025-02-06 03:14:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-02-06 03:14:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:40,851 INFO L225 Difference]: With dead ends: 393 [2025-02-06 03:14:40,851 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 03:14:40,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:40,852 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 138 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:40,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 609 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 03:14:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2025-02-06 03:14:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 209 states have (on average 1.30622009569378) internal successors, (273), 209 states have internal predecessors, (273), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:14:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 365 transitions. [2025-02-06 03:14:40,869 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 365 transitions. Word has length 178 [2025-02-06 03:14:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 365 transitions. [2025-02-06 03:14:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 365 transitions. [2025-02-06 03:14:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 03:14:40,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:40,871 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:14:40,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 333372794, now seen corresponding path program 1 times [2025-02-06 03:14:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453471548] [2025-02-06 03:14:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:14:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:14:40,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453471548] [2025-02-06 03:14:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453471548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:41,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:41,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470272654] [2025-02-06 03:14:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:41,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:41,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:41,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:41,373 INFO L87 Difference]: Start difference. First operand 258 states and 365 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:14:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:41,608 INFO L93 Difference]: Finished difference Result 511 states and 724 transitions. [2025-02-06 03:14:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2025-02-06 03:14:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:41,611 INFO L225 Difference]: With dead ends: 511 [2025-02-06 03:14:41,611 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 03:14:41,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:14:41,612 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 184 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:41,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 447 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 03:14:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 130. [2025-02-06 03:14:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:14:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2025-02-06 03:14:41,623 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2025-02-06 03:14:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2025-02-06 03:14:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:14:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2025-02-06 03:14:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:41,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:41,625 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:41,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:14:41,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1670336742, now seen corresponding path program 1 times [2025-02-06 03:14:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260234070] [2025-02-06 03:14:41,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:41,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:41,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:41,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:41,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:41,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260234070] [2025-02-06 03:14:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260234070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:41,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:41,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:14:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539173935] [2025-02-06 03:14:41,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:41,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:41,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:14:41,820 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:41,969 INFO L93 Difference]: Finished difference Result 360 states and 506 transitions. [2025-02-06 03:14:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:41,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:41,971 INFO L225 Difference]: With dead ends: 360 [2025-02-06 03:14:41,971 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 03:14:41,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:14:41,972 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 115 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:41,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 422 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 03:14:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 189. [2025-02-06 03:14:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 140 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:14:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 266 transitions. [2025-02-06 03:14:41,985 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 266 transitions. Word has length 180 [2025-02-06 03:14:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 266 transitions. [2025-02-06 03:14:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 266 transitions. [2025-02-06 03:14:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:41,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:41,987 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:41,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:14:41,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash 114114623, now seen corresponding path program 1 times [2025-02-06 03:14:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018586586] [2025-02-06 03:14:41,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:42,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:42,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:42,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:42,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018586586] [2025-02-06 03:14:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018586586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754445041] [2025-02-06 03:14:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:42,339 INFO L87 Difference]: Start difference. First operand 189 states and 266 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:42,466 INFO L93 Difference]: Finished difference Result 365 states and 507 transitions. [2025-02-06 03:14:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:14:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:42,468 INFO L225 Difference]: With dead ends: 365 [2025-02-06 03:14:42,469 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 03:14:42,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:42,470 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 91 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 551 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 03:14:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-02-06 03:14:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 178 states have internal predecessors, (219), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:14:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 323 transitions. [2025-02-06 03:14:42,491 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 323 transitions. Word has length 180 [2025-02-06 03:14:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:42,491 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 323 transitions. [2025-02-06 03:14:42,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 323 transitions. [2025-02-06 03:14:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:42,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:42,492 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:42,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:14:42,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:42,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1682836736, now seen corresponding path program 1 times [2025-02-06 03:14:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:42,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746253871] [2025-02-06 03:14:42,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:42,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:42,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:42,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746253871] [2025-02-06 03:14:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746253871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:43,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:43,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096752020] [2025-02-06 03:14:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:43,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:43,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:43,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:43,075 INFO L87 Difference]: Start difference. First operand 234 states and 323 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:43,214 INFO L93 Difference]: Finished difference Result 479 states and 659 transitions. [2025-02-06 03:14:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-02-06 03:14:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:43,219 INFO L225 Difference]: With dead ends: 479 [2025-02-06 03:14:43,219 INFO L226 Difference]: Without dead ends: 311 [2025-02-06 03:14:43,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:14:43,221 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:43,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 716 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-06 03:14:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 271. [2025-02-06 03:14:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 214 states have (on average 1.2616822429906542) internal successors, (270), 215 states have internal predecessors, (270), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:14:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 374 transitions. [2025-02-06 03:14:43,244 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 374 transitions. Word has length 180 [2025-02-06 03:14:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 374 transitions. [2025-02-06 03:14:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 374 transitions. [2025-02-06 03:14:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:43,246 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:14:43,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1393437186, now seen corresponding path program 1 times [2025-02-06 03:14:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477738401] [2025-02-06 03:14:43,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:43,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:43,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:43,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:43,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:44,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477738401] [2025-02-06 03:14:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477738401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:44,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:44,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:14:44,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615829058] [2025-02-06 03:14:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:44,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:14:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:44,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:14:44,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:44,574 INFO L87 Difference]: Start difference. First operand 271 states and 374 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:44,915 INFO L93 Difference]: Finished difference Result 614 states and 839 transitions. [2025-02-06 03:14:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:14:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-02-06 03:14:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:44,918 INFO L225 Difference]: With dead ends: 614 [2025-02-06 03:14:44,918 INFO L226 Difference]: Without dead ends: 409 [2025-02-06 03:14:44,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:14:44,920 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 65 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:44,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1305 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-06 03:14:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2025-02-06 03:14:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 338 states have (on average 1.272189349112426) internal successors, (430), 341 states have internal predecessors, (430), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:14:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 550 transitions. [2025-02-06 03:14:44,955 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 550 transitions. Word has length 180 [2025-02-06 03:14:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 550 transitions. [2025-02-06 03:14:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 550 transitions. [2025-02-06 03:14:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:44,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:44,957 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:44,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:14:44,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:44,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1104578751, now seen corresponding path program 1 times [2025-02-06 03:14:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112238322] [2025-02-06 03:14:44,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:44,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:44,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:44,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:45,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:45,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112238322] [2025-02-06 03:14:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112238322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:45,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352948278] [2025-02-06 03:14:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:45,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:45,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:45,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:45,202 INFO L87 Difference]: Start difference. First operand 405 states and 550 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:45,333 INFO L93 Difference]: Finished difference Result 879 states and 1188 transitions. [2025-02-06 03:14:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:45,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:45,336 INFO L225 Difference]: With dead ends: 879 [2025-02-06 03:14:45,337 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 03:14:45,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:45,338 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 91 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:45,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 624 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 03:14:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 385. [2025-02-06 03:14:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 318 states have (on average 1.270440251572327) internal successors, (404), 321 states have internal predecessors, (404), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:14:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 524 transitions. [2025-02-06 03:14:45,371 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 524 transitions. Word has length 180 [2025-02-06 03:14:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:45,372 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 524 transitions. [2025-02-06 03:14:45,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 524 transitions. [2025-02-06 03:14:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:45,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:45,374 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:14:45,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:45,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:45,374 INFO L85 PathProgramCache]: Analyzing trace with hash 811175744, now seen corresponding path program 1 times [2025-02-06 03:14:45,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028012034] [2025-02-06 03:14:45,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:45,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:45,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:45,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:45,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028012034] [2025-02-06 03:14:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028012034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:45,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887367355] [2025-02-06 03:14:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:45,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:45,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:45,766 INFO L87 Difference]: Start difference. First operand 385 states and 524 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:45,906 INFO L93 Difference]: Finished difference Result 967 states and 1308 transitions. [2025-02-06 03:14:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-02-06 03:14:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:45,910 INFO L225 Difference]: With dead ends: 967 [2025-02-06 03:14:45,910 INFO L226 Difference]: Without dead ends: 648 [2025-02-06 03:14:45,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:14:45,911 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 69 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:45,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 735 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-02-06 03:14:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2025-02-06 03:14:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 552 states have (on average 1.2753623188405796) internal successors, (704), 559 states have internal predecessors, (704), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:14:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 868 transitions. [2025-02-06 03:14:45,947 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 868 transitions. Word has length 180 [2025-02-06 03:14:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:45,947 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 868 transitions. [2025-02-06 03:14:45,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 868 transitions. [2025-02-06 03:14:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:45,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:45,949 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:45,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:14:45,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash 824320767, now seen corresponding path program 1 times [2025-02-06 03:14:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:45,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788764577] [2025-02-06 03:14:45,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:45,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:45,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:45,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:45,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:45,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788764577] [2025-02-06 03:14:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788764577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:46,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:46,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025935455] [2025-02-06 03:14:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:46,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:46,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:46,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:46,132 INFO L87 Difference]: Start difference. First operand 645 states and 868 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:46,256 INFO L93 Difference]: Finished difference Result 1330 states and 1778 transitions. [2025-02-06 03:14:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:46,259 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 03:14:46,259 INFO L226 Difference]: Without dead ends: 751 [2025-02-06 03:14:46,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:46,261 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 145 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:46,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 613 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-06 03:14:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 665. [2025-02-06 03:14:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 572 states have internal predecessors, (713), 88 states have call successors, (88), 12 states have call predecessors, (88), 12 states have return successors, (88), 80 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-06 03:14:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 889 transitions. [2025-02-06 03:14:46,325 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 889 transitions. Word has length 180 [2025-02-06 03:14:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:46,325 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 889 transitions. [2025-02-06 03:14:46,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 889 transitions. [2025-02-06 03:14:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:46,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:46,327 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:14:46,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:46,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1772789761, now seen corresponding path program 1 times [2025-02-06 03:14:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:46,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594279243] [2025-02-06 03:14:46,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:46,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:46,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:46,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:46,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:46,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:46,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594279243] [2025-02-06 03:14:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594279243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:14:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554658897] [2025-02-06 03:14:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:46,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:46,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:46,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:14:46,400 INFO L87 Difference]: Start difference. First operand 665 states and 889 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:46,439 INFO L93 Difference]: Finished difference Result 1142 states and 1527 transitions. [2025-02-06 03:14:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:46,443 INFO L225 Difference]: With dead ends: 1142 [2025-02-06 03:14:46,443 INFO L226 Difference]: Without dead ends: 543 [2025-02-06 03:14:46,444 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:14:46,445 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 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:14:46,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-06 03:14:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-02-06 03:14:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 452 states have (on average 1.247787610619469) internal successors, (564), 458 states have internal predecessors, (564), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:14:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 724 transitions. [2025-02-06 03:14:46,481 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 724 transitions. Word has length 180 [2025-02-06 03:14:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:46,481 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 724 transitions. [2025-02-06 03:14:46,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 724 transitions. [2025-02-06 03:14:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:46,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:46,483 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:14:46,484 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1785934784, now seen corresponding path program 1 times [2025-02-06 03:14:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549007191] [2025-02-06 03:14:46,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:46,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:46,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549007191] [2025-02-06 03:14:46,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549007191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:46,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:46,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24291656] [2025-02-06 03:14:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:46,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:46,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:46,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:46,833 INFO L87 Difference]: Start difference. First operand 543 states and 724 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:46,973 INFO L93 Difference]: Finished difference Result 1029 states and 1364 transitions. [2025-02-06 03:14:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-02-06 03:14:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:46,976 INFO L225 Difference]: With dead ends: 1029 [2025-02-06 03:14:46,976 INFO L226 Difference]: Without dead ends: 552 [2025-02-06 03:14:46,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:14:46,977 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 121 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:46,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 628 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-06 03:14:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 473. [2025-02-06 03:14:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 396 states have (on average 1.2424242424242424) internal successors, (492), 400 states have internal predecessors, (492), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:14:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 624 transitions. [2025-02-06 03:14:47,010 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 624 transitions. Word has length 180 [2025-02-06 03:14:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:47,011 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 624 transitions. [2025-02-06 03:14:47,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 624 transitions. [2025-02-06 03:14:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:47,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:47,012 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:47,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:14:47,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:47,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -304419582, now seen corresponding path program 1 times [2025-02-06 03:14:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:47,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838569689] [2025-02-06 03:14:47,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:47,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:47,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838569689] [2025-02-06 03:14:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838569689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:14:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840367560] [2025-02-06 03:14:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:14:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:14:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:47,489 INFO L87 Difference]: Start difference. First operand 473 states and 624 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:47,760 INFO L93 Difference]: Finished difference Result 989 states and 1301 transitions. [2025-02-06 03:14:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:14:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:47,764 INFO L225 Difference]: With dead ends: 989 [2025-02-06 03:14:47,764 INFO L226 Difference]: Without dead ends: 586 [2025-02-06 03:14:47,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:14:47,766 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 148 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:47,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 2078 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-06 03:14:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 452. [2025-02-06 03:14:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 375 states have (on average 1.2373333333333334) internal successors, (464), 378 states have internal predecessors, (464), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:14:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 596 transitions. [2025-02-06 03:14:47,798 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 596 transitions. Word has length 180 [2025-02-06 03:14:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 596 transitions. [2025-02-06 03:14:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 596 transitions. [2025-02-06 03:14:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:47,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:47,800 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:14:47,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:47,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash -989735039, now seen corresponding path program 1 times [2025-02-06 03:14:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890379814] [2025-02-06 03:14:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:47,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:47,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890379814] [2025-02-06 03:14:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890379814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:47,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:47,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590802532] [2025-02-06 03:14:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:47,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:47,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:47,990 INFO L87 Difference]: Start difference. First operand 452 states and 596 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:48,136 INFO L93 Difference]: Finished difference Result 818 states and 1072 transitions. [2025-02-06 03:14:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:14:48,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:14:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:48,139 INFO L225 Difference]: With dead ends: 818 [2025-02-06 03:14:48,139 INFO L226 Difference]: Without dead ends: 436 [2025-02-06 03:14:48,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:48,140 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 145 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:48,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 663 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-06 03:14:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 351. [2025-02-06 03:14:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 290 states have (on average 1.2206896551724138) internal successors, (354), 291 states have internal predecessors, (354), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:14:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 458 transitions. [2025-02-06 03:14:48,161 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 458 transitions. Word has length 180 [2025-02-06 03:14:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:48,161 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 458 transitions. [2025-02-06 03:14:48,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 458 transitions. [2025-02-06 03:14:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:14:48,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:48,165 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:48,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:14:48,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:48,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1517422464, now seen corresponding path program 1 times [2025-02-06 03:14:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276479710] [2025-02-06 03:14:48,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:48,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:14:48,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:14:48,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:48,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276479710] [2025-02-06 03:14:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276479710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723592238] [2025-02-06 03:14:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:48,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:48,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:48,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:48,512 INFO L87 Difference]: Start difference. First operand 351 states and 458 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:48,634 INFO L93 Difference]: Finished difference Result 670 states and 872 transitions. [2025-02-06 03:14:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:48,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-02-06 03:14:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:48,637 INFO L225 Difference]: With dead ends: 670 [2025-02-06 03:14:48,637 INFO L226 Difference]: Without dead ends: 389 [2025-02-06 03:14:48,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:14:48,638 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 121 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:48,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 680 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-06 03:14:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 345. [2025-02-06 03:14:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 284 states have (on average 1.2183098591549295) internal successors, (346), 285 states have internal predecessors, (346), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:14:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 450 transitions. [2025-02-06 03:14:48,658 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 450 transitions. Word has length 180 [2025-02-06 03:14:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:48,658 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 450 transitions. [2025-02-06 03:14:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:14:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 450 transitions. [2025-02-06 03:14:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-06 03:14:48,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:48,660 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:14:48,660 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:48,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1091105771, now seen corresponding path program 1 times [2025-02-06 03:14:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118562481] [2025-02-06 03:14:48,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:48,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 03:14:48,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 03:14:48,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:48,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:14:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118562481] [2025-02-06 03:14:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118562481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080880525] [2025-02-06 03:14:48,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:48,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:48,788 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:14:48,791 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:14:48,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 03:14:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 03:14:48,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:48,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:14:48,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:49,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080880525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:49,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:14:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668152965] [2025-02-06 03:14:49,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:49,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:49,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:49,005 INFO L87 Difference]: Start difference. First operand 345 states and 450 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:49,034 INFO L93 Difference]: Finished difference Result 626 states and 815 transitions. [2025-02-06 03:14:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-02-06 03:14:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:49,036 INFO L225 Difference]: With dead ends: 626 [2025-02-06 03:14:49,036 INFO L226 Difference]: Without dead ends: 351 [2025-02-06 03:14:49,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 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:14:49,037 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:49,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-06 03:14:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-02-06 03:14:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 290 states have (on average 1.2137931034482758) internal successors, (352), 291 states have internal predecessors, (352), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:14:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 456 transitions. [2025-02-06 03:14:49,053 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 456 transitions. Word has length 182 [2025-02-06 03:14:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:49,054 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 456 transitions. [2025-02-06 03:14:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 456 transitions. [2025-02-06 03:14:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:14:49,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:49,055 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:49,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:14:49,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:49,256 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:49,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1407024813, now seen corresponding path program 1 times [2025-02-06 03:14:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055756023] [2025-02-06 03:14:49,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:49,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:14:49,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:14:49,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:14:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055756023] [2025-02-06 03:14:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055756023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:49,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:49,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204315008] [2025-02-06 03:14:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:49,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:49,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:49,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:49,519 INFO L87 Difference]: Start difference. First operand 351 states and 456 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:49,638 INFO L93 Difference]: Finished difference Result 623 states and 801 transitions. [2025-02-06 03:14:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:14:49,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2025-02-06 03:14:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:49,641 INFO L225 Difference]: With dead ends: 623 [2025-02-06 03:14:49,641 INFO L226 Difference]: Without dead ends: 621 [2025-02-06 03:14:49,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:14:49,642 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 91 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:49,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1119 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-02-06 03:14:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2025-02-06 03:14:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 531 states have (on average 1.2203389830508475) internal successors, (648), 534 states have internal predecessors, (648), 73 states have call successors, (73), 13 states have call predecessors, (73), 13 states have return successors, (73), 70 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:14:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 794 transitions. [2025-02-06 03:14:49,668 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 794 transitions. Word has length 184 [2025-02-06 03:14:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 794 transitions. [2025-02-06 03:14:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:14:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 794 transitions. [2025-02-06 03:14:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:14:49,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:49,670 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:49,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:14:49,670 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:49,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 318456084, now seen corresponding path program 1 times [2025-02-06 03:14:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:49,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675678643] [2025-02-06 03:14:49,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:49,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:14:49,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:14:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:49,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:14:49,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:14:49,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:14:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:14:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:49,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:14:49,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:14:49,850 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:14:49,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:14:49,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:14:49,854 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] [2025-02-06 03:14:49,937 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:14:49,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:14:49 BoogieIcfgContainer [2025-02-06 03:14:49,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:14:49,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:14:49,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:14:49,941 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:14:49,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:37" (3/4) ... [2025-02-06 03:14:49,943 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:14:49,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:14:49,944 INFO L158 Benchmark]: Toolchain (without parser) took 13307.18ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 122.1MB in the beginning and 432.7MB in the end (delta: -310.6MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. [2025-02-06 03:14:49,944 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:49,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.20ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 107.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:14:49,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.73ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:49,947 INFO L158 Benchmark]: Boogie Preprocessor took 40.91ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 100.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:49,947 INFO L158 Benchmark]: IcfgBuilder took 506.02ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 67.8MB in the end (delta: 32.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:14:49,947 INFO L158 Benchmark]: TraceAbstraction took 12531.33ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 67.2MB in the beginning and 436.9MB in the end (delta: -369.7MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2025-02-06 03:14:49,947 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 620.8MB. Free memory is still 432.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:49,948 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.19ms. Allocated memory is still 209.7MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.20ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 107.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.73ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.91ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 100.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 506.02ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 67.8MB in the end (delta: 32.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12531.33ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 67.2MB in the beginning and 436.9MB in the end (delta: -369.7MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 620.8MB. Free memory is still 432.7MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR BOOL_unsigned_char_Array_0[1][1] [L99] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L110] RET updateVariables() [L111] CALL step() [L38] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] EXPR double_Array_0[1] [L43] EXPR double_Array_0[0] [L43] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] COND FALSE !(double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) [L46] EXPR BOOL_unsigned_char_Array_0[0][2] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) [L46] EXPR signed_char_Array_0[2] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) [L47] EXPR BOOL_unsigned_char_Array_0[1][2] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] [L47] EXPR BOOL_unsigned_char_Array_0[0][2] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] [L47] EXPR BOOL_unsigned_char_Array_0[0][1] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] BOOL_unsigned_char_Array_0[1][1] = ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]) [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] signed long int stepLocal_1 = (unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1))); [L52] EXPR signed_char_Array_0[2] [L52] signed char stepLocal_0 = signed_char_Array_0[2]; [L53] COND FALSE !(-10 >= stepLocal_0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) [L102] EXPR BOOL_unsigned_char_Array_0[0][2] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) [L102] EXPR signed_char_Array_0[2] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) [L102] EXPR BOOL_unsigned_char_Array_0[1][1] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] [L102] EXPR BOOL_unsigned_char_Array_0[0][1] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) [L102] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) [L102] EXPR double_Array_0[1] [L102] EXPR double_Array_0[0] [L102] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 [L102] EXPR signed_char_Array_0[2] [L102] EXPR signed_char_Array_0[4] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102-L103] return (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 23, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1923 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1918 mSDsluCounter, 14308 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10505 mSDsCounter, 436 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1996 IncrementalHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 436 mSolverCounterUnsat, 3803 mSDtfsCounter, 1996 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=665occurred in iteration=15, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 871 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4633 NumberOfCodeBlocks, 4633 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4424 ConstructedInterpolants, 0 QuantifiedInterpolants, 7248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 25124/25300 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:14:49,973 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-a_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:14:52,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:14:52,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:14:52,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:14:52,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:14:52,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:14:52,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:14:52,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:14:52,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:14:52,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:14:52,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:14:52,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:14:52,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:14:52,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:14:52,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:14:52,128 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:14:52,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:52,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:14:52,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:14:52,129 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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2025-02-06 03:14:52,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:14:52,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:14:52,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:14:52,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:14:52,373 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:14:52,373 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-a_file-34.i [2025-02-06 03:14:53,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e13170fb9/ef174f1ec79048fbacf7d033b9d3e1c4/FLAG9fbe3324f [2025-02-06 03:14:53,867 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:14:53,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2025-02-06 03:14:53,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e13170fb9/ef174f1ec79048fbacf7d033b9d3e1c4/FLAG9fbe3324f [2025-02-06 03:14:53,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e13170fb9/ef174f1ec79048fbacf7d033b9d3e1c4 [2025-02-06 03:14:53,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:14:53,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:14:53,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:53,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:14:53,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:14:53,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:53" (1/1) ... [2025-02-06 03:14:53,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f76c0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:53, skipping insertion in model container [2025-02-06 03:14:53,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:53" (1/1) ... [2025-02-06 03:14:53,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:14:54,035 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-a_file-34.i[916,929] [2025-02-06 03:14:54,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:54,117 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:14:54,125 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-a_file-34.i[916,929] [2025-02-06 03:14:54,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:54,196 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:14:54,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54 WrapperNode [2025-02-06 03:14:54,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:54,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:54,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:14:54,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:14:54,202 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:14:54" (1/1) ... [2025-02-06 03:14:54,212 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:14:54" (1/1) ... [2025-02-06 03:14:54,236 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2025-02-06 03:14:54,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:54,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:14:54,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:14:54,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:14:54,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,278 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2025-02-06 03:14:54,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:14:54,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:14:54,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:14:54,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:14:54,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (1/1) ... [2025-02-06 03:14:54,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:54,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:54,348 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:14:54,350 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:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:14:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:14:54,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:14:54,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:14:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:14:54,469 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:14:54,470 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:15:07,591 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~short89#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~ite110#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short118#1; [2025-02-06 03:15:07,652 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-02-06 03:15:07,652 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:15:07,659 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:15:07,659 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:15:07,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:07 BoogieIcfgContainer [2025-02-06 03:15:07,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:15:07,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:15:07,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:15:07,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:15:07,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:14:53" (1/3) ... [2025-02-06 03:15:07,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6645f575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:15:07, skipping insertion in model container [2025-02-06 03:15:07,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:54" (2/3) ... [2025-02-06 03:15:07,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6645f575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:15:07, skipping insertion in model container [2025-02-06 03:15:07,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:07" (3/3) ... [2025-02-06 03:15:07,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2025-02-06 03:15:07,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:15:07,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:15:07,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:15:07,717 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;@22028fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:15:07,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:15:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:15:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 03:15:07,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:07,732 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:07,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash 855180355, now seen corresponding path program 1 times [2025-02-06 03:15:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:07,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025005851] [2025-02-06 03:15:07,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:07,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:07,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:07,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:07,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:15:07,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 03:15:08,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 03:15:08,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:08,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:08,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:15:08,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-02-06 03:15:08,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:08,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025005851] [2025-02-06 03:15:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025005851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:08,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:08,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:15:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686966852] [2025-02-06 03:15:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:08,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:15:08,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:08,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:15:08,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:15:08,202 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:15:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:08,227 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-02-06 03:15:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:15:08,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-02-06 03:15:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:08,232 INFO L225 Difference]: With dead ends: 232 [2025-02-06 03:15:08,232 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 03:15:08,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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:15:08,236 INFO L435 NwaCegarLoop]: 168 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, 168 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:15:08,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 03:15:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 03:15:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:15:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-02-06 03:15:08,262 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-02-06 03:15:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:08,263 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-02-06 03:15:08,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:15:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-02-06 03:15:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 03:15:08,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:08,265 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:08,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:15:08,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:08,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:08,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:08,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2030050746, now seen corresponding path program 1 times [2025-02-06 03:15:08,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727753871] [2025-02-06 03:15:08,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:08,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:08,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:15:08,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 03:15:08,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 03:15:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:08,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 03:15:08,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:08,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:08,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727753871] [2025-02-06 03:15:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727753871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582148046] [2025-02-06 03:15:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:08,908 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:08,945 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2025-02-06 03:15:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-02-06 03:15:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:08,947 INFO L225 Difference]: With dead ends: 227 [2025-02-06 03:15:08,947 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:15:08,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:08,948 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:08,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:15:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 03:15:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:15:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-02-06 03:15:08,956 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171 [2025-02-06 03:15:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:08,957 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-02-06 03:15:08,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-02-06 03:15:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 03:15:08,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:08,961 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:08,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:15:09,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:09,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -188095999, now seen corresponding path program 1 times [2025-02-06 03:15:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585336948] [2025-02-06 03:15:09,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:09,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:09,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:09,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:09,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:15:09,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 03:15:09,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 03:15:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:09,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:09,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:09,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:09,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:09,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585336948] [2025-02-06 03:15:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585336948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:09,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:09,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975131250] [2025-02-06 03:15:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:09,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:09,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:09,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:09,560 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:09,641 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2025-02-06 03:15:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-02-06 03:15:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:09,646 INFO L225 Difference]: With dead ends: 227 [2025-02-06 03:15:09,646 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 03:15:09,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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:15:09,647 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:09,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 03:15:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 03:15:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:15:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-02-06 03:15:09,659 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173 [2025-02-06 03:15:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:09,663 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-02-06 03:15:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-02-06 03:15:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 03:15:09,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:09,666 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:09,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:15:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:09,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1513842723, now seen corresponding path program 1 times [2025-02-06 03:15:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664419767] [2025-02-06 03:15:09,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:09,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:09,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:15:09,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 03:15:10,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 03:15:10,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:10,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:10,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:10,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:11,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:11,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664419767] [2025-02-06 03:15:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664419767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494179083] [2025-02-06 03:15:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:11,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:11,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:11,175 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:11,521 INFO L93 Difference]: Finished difference Result 344 states and 494 transitions. [2025-02-06 03:15:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:11,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-02-06 03:15:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:11,523 INFO L225 Difference]: With dead ends: 344 [2025-02-06 03:15:11,523 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 03:15:11,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:15:11,525 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 107 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:11,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 436 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:15:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 03:15:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 191. [2025-02-06 03:15:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 142 states have internal predecessors, (181), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:15:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2025-02-06 03:15:11,542 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 175 [2025-02-06 03:15:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2025-02-06 03:15:11,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2025-02-06 03:15:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 03:15:11,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:11,544 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:11,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:15:11,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:11,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:11,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash -921644230, now seen corresponding path program 1 times [2025-02-06 03:15:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423437403] [2025-02-06 03:15:11,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:11,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:11,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:11,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:15:11,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:15:12,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:15:12,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:12,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:12,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 03:15:12,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:12,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:12,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:12,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423437403] [2025-02-06 03:15:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423437403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:12,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989275239] [2025-02-06 03:15:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:12,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:12,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:12,099 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:12,133 INFO L93 Difference]: Finished difference Result 318 states and 456 transitions. [2025-02-06 03:15:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-02-06 03:15:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:12,137 INFO L225 Difference]: With dead ends: 318 [2025-02-06 03:15:12,137 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 03:15:12,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:12,138 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:12,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 03:15:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-06 03:15:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:15:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 269 transitions. [2025-02-06 03:15:12,163 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 269 transitions. Word has length 178 [2025-02-06 03:15:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:12,163 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 269 transitions. [2025-02-06 03:15:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 269 transitions. [2025-02-06 03:15:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:12,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:12,165 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:12,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:12,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:12,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:12,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 114114623, now seen corresponding path program 1 times [2025-02-06 03:15:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584849219] [2025-02-06 03:15:12,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:12,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:12,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:15:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:12,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:12,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:12,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:12,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:15:12,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:12,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:12,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584849219] [2025-02-06 03:15:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584849219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:12,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:12,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449761512] [2025-02-06 03:15:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:12,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:12,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:12,887 INFO L87 Difference]: Start difference. First operand 189 states and 269 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:13,311 INFO L93 Difference]: Finished difference Result 365 states and 513 transitions. [2025-02-06 03:15:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:15:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:13,316 INFO L225 Difference]: With dead ends: 365 [2025-02-06 03:15:13,316 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 03:15:13,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 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:15:13,316 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 53 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:13,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 681 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:15:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 03:15:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-02-06 03:15:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.2542372881355932) internal successors, (222), 178 states have internal predecessors, (222), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:15:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2025-02-06 03:15:13,330 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 180 [2025-02-06 03:15:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:13,331 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2025-02-06 03:15:13,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2025-02-06 03:15:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:13,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:13,332 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:13,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:15:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:13,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1682836736, now seen corresponding path program 1 times [2025-02-06 03:15:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905738466] [2025-02-06 03:15:13,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:13,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:13,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:15:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:13,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:13,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:13,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:13,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:15:14,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:14,016 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 14 treesize of output 10 [2025-02-06 03:15:14,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2025-02-06 03:15:16,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:16,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-02-06 03:15:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 45 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-02-06 03:15:17,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:17,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905738466] [2025-02-06 03:15:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905738466] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:17,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:17,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2025-02-06 03:15:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070932198] [2025-02-06 03:15:17,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:17,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:17,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:17,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:15:17,530 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:17,770 INFO L93 Difference]: Finished difference Result 479 states and 667 transitions. [2025-02-06 03:15:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:15:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:17,773 INFO L225 Difference]: With dead ends: 479 [2025-02-06 03:15:17,773 INFO L226 Difference]: Without dead ends: 311 [2025-02-06 03:15:17,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:15:17,774 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 123 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:17,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 459 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-06 03:15:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 271. [2025-02-06 03:15:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 214 states have (on average 1.2850467289719627) internal successors, (275), 215 states have internal predecessors, (275), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:15:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 379 transitions. [2025-02-06 03:15:17,787 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 379 transitions. Word has length 180 [2025-02-06 03:15:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:17,787 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 379 transitions. [2025-02-06 03:15:17,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2025-02-06 03:15:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:17,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:17,789 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:17,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:15:17,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:17,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:17,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1393437186, now seen corresponding path program 1 times [2025-02-06 03:15:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:17,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393112731] [2025-02-06 03:15:17,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:17,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:17,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:17,995 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:17,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:15:18,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:18,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:18,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:18,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:18,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:15:18,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:18,463 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 8 treesize of output 1 [2025-02-06 03:15:18,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:15:18,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:18,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2025-02-06 03:15:21,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:21,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2025-02-06 03:15:22,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:22,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 42 [2025-02-06 03:15:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 458 proven. 102 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-02-06 03:15:22,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:23,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393112731] [2025-02-06 03:15:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393112731] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 24 [2025-02-06 03:15:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496099349] [2025-02-06 03:15:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:23,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:15:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:23,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:15:23,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:15:23,773 INFO L87 Difference]: Start difference. First operand 271 states and 379 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:24,778 INFO L93 Difference]: Finished difference Result 614 states and 853 transitions. [2025-02-06 03:15:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:15:24,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:24,784 INFO L225 Difference]: With dead ends: 614 [2025-02-06 03:15:24,784 INFO L226 Difference]: Without dead ends: 409 [2025-02-06 03:15:24,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:15:24,786 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 66 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:24,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1199 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:15:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-06 03:15:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2025-02-06 03:15:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 338 states have (on average 1.2988165680473374) internal successors, (439), 341 states have internal predecessors, (439), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:15:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 559 transitions. [2025-02-06 03:15:24,805 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 559 transitions. Word has length 180 [2025-02-06 03:15:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 559 transitions. [2025-02-06 03:15:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 559 transitions. [2025-02-06 03:15:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:24,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:24,809 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:15:25,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:25,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:25,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1104578751, now seen corresponding path program 1 times [2025-02-06 03:15:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065913533] [2025-02-06 03:15:25,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:25,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:25,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:25,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:25,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:15:25,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:25,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:25,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:25,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:25,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:15:25,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:25,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:25,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065913533] [2025-02-06 03:15:25,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065913533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:25,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820355433] [2025-02-06 03:15:25,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:25,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:25,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:25,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:25,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:25,418 INFO L87 Difference]: Start difference. First operand 405 states and 559 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:26,021 INFO L93 Difference]: Finished difference Result 879 states and 1206 transitions. [2025-02-06 03:15:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:15:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:26,034 INFO L225 Difference]: With dead ends: 879 [2025-02-06 03:15:26,034 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 03:15:26,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:15:26,040 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 52 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:26,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 771 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:15:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 03:15:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 385. [2025-02-06 03:15:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 318 states have (on average 1.29874213836478) internal successors, (413), 321 states have internal predecessors, (413), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:15:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 533 transitions. [2025-02-06 03:15:26,073 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 533 transitions. Word has length 180 [2025-02-06 03:15:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:26,074 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 533 transitions. [2025-02-06 03:15:26,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 533 transitions. [2025-02-06 03:15:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:26,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:26,079 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:26,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:26,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash 811175744, now seen corresponding path program 1 times [2025-02-06 03:15:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679582456] [2025-02-06 03:15:26,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:26,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:26,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:26,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:26,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:15:26,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:26,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:26,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:26,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:26,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:15:26,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:26,983 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 19 treesize of output 1 [2025-02-06 03:15:27,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 03:15:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 03:15:27,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:28,098 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679582456] [2025-02-06 03:15:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679582456] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:28,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:28,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-02-06 03:15:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748107704] [2025-02-06 03:15:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:28,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:28,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:28,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:15:28,100 INFO L87 Difference]: Start difference. First operand 385 states and 533 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:28,325 INFO L93 Difference]: Finished difference Result 967 states and 1334 transitions. [2025-02-06 03:15:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:15:28,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:28,328 INFO L225 Difference]: With dead ends: 967 [2025-02-06 03:15:28,328 INFO L226 Difference]: Without dead ends: 648 [2025-02-06 03:15:28,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:15:28,329 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 123 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:28,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 474 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-02-06 03:15:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2025-02-06 03:15:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 552 states have (on average 1.306159420289855) internal successors, (721), 559 states have internal predecessors, (721), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 03:15:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 885 transitions. [2025-02-06 03:15:28,349 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 885 transitions. Word has length 180 [2025-02-06 03:15:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 885 transitions. [2025-02-06 03:15:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 885 transitions. [2025-02-06 03:15:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:28,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:28,350 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:28,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:15:28,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:28,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:28,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash 824320767, now seen corresponding path program 1 times [2025-02-06 03:15:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226863823] [2025-02-06 03:15:28,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:28,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:28,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:15:28,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:28,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:28,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:28,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:28,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:15:28,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:29,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:29,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:29,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226863823] [2025-02-06 03:15:29,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226863823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:29,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:29,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023869178] [2025-02-06 03:15:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:29,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:29,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:29,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:29,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:29,139 INFO L87 Difference]: Start difference. First operand 645 states and 885 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:29,608 INFO L93 Difference]: Finished difference Result 1330 states and 1810 transitions. [2025-02-06 03:15:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:15:29,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:29,612 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 03:15:29,612 INFO L226 Difference]: Without dead ends: 751 [2025-02-06 03:15:29,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:15:29,614 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 80 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:29,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 760 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:15:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-06 03:15:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 665. [2025-02-06 03:15:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 564 states have (on average 1.2907801418439717) internal successors, (728), 572 states have internal predecessors, (728), 88 states have call successors, (88), 12 states have call predecessors, (88), 12 states have return successors, (88), 80 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-06 03:15:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 904 transitions. [2025-02-06 03:15:29,646 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 904 transitions. Word has length 180 [2025-02-06 03:15:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 904 transitions. [2025-02-06 03:15:29,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 904 transitions. [2025-02-06 03:15:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:29,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:29,649 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:29,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:29,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:29,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1772789761, now seen corresponding path program 1 times [2025-02-06 03:15:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:29,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822243964] [2025-02-06 03:15:29,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:29,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:29,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:29,853 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:29,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:15:29,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:30,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:30,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:30,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:30,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:30,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:30,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:30,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822243964] [2025-02-06 03:15:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822243964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:30,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981361615] [2025-02-06 03:15:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:30,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:30,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:30,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:30,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:30,203 INFO L87 Difference]: Start difference. First operand 665 states and 904 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:30,264 INFO L93 Difference]: Finished difference Result 1142 states and 1553 transitions. [2025-02-06 03:15:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:30,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:30,269 INFO L225 Difference]: With dead ends: 1142 [2025-02-06 03:15:30,270 INFO L226 Difference]: Without dead ends: 543 [2025-02-06 03:15:30,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 177 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:15:30,271 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 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:15:30,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-06 03:15:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-02-06 03:15:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 452 states have (on average 1.2721238938053097) internal successors, (575), 458 states have internal predecessors, (575), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:15:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 735 transitions. [2025-02-06 03:15:30,303 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 735 transitions. Word has length 180 [2025-02-06 03:15:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:30,303 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 735 transitions. [2025-02-06 03:15:30,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 735 transitions. [2025-02-06 03:15:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:30,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:30,304 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:30,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:15:30,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:30,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1785934784, now seen corresponding path program 1 times [2025-02-06 03:15:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886515125] [2025-02-06 03:15:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:30,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:30,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:30,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:30,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:15:30,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:30,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:30,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:30,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:30,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:15:30,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:31,008 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 19 treesize of output 1 [2025-02-06 03:15:31,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:15:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 03:15:32,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:32,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886515125] [2025-02-06 03:15:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886515125] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-02-06 03:15:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507938435] [2025-02-06 03:15:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:32,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:32,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:15:32,250 INFO L87 Difference]: Start difference. First operand 543 states and 735 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:32,440 INFO L93 Difference]: Finished difference Result 1029 states and 1386 transitions. [2025-02-06 03:15:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:15:32,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:32,443 INFO L225 Difference]: With dead ends: 1029 [2025-02-06 03:15:32,443 INFO L226 Difference]: Without dead ends: 552 [2025-02-06 03:15:32,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:15:32,445 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 123 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:32,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 489 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-06 03:15:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 473. [2025-02-06 03:15:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 396 states have (on average 1.27020202020202) internal successors, (503), 400 states have internal predecessors, (503), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:15:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 635 transitions. [2025-02-06 03:15:32,468 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 635 transitions. Word has length 180 [2025-02-06 03:15:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:32,468 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 635 transitions. [2025-02-06 03:15:32,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 635 transitions. [2025-02-06 03:15:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:32,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:32,469 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:32,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 03:15:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:32,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:32,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash -304419582, now seen corresponding path program 1 times [2025-02-06 03:15:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909995692] [2025-02-06 03:15:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:32,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:32,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:32,673 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:32,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:15:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:32,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:32,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:15:32,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:33,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:15:33,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:33,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:33,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909995692] [2025-02-06 03:15:33,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909995692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:33,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:15:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875184369] [2025-02-06 03:15:33,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:33,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:15:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:33,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:15:33,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:15:33,203 INFO L87 Difference]: Start difference. First operand 473 states and 635 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:34,051 INFO L93 Difference]: Finished difference Result 991 states and 1326 transitions. [2025-02-06 03:15:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:15:34,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:34,054 INFO L225 Difference]: With dead ends: 991 [2025-02-06 03:15:34,054 INFO L226 Difference]: Without dead ends: 588 [2025-02-06 03:15:34,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:15:34,055 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 152 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:34,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2637 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:15:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-06 03:15:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 452. [2025-02-06 03:15:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 375 states have (on average 1.2666666666666666) internal successors, (475), 378 states have internal predecessors, (475), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 03:15:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 607 transitions. [2025-02-06 03:15:34,068 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 607 transitions. Word has length 180 [2025-02-06 03:15:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:34,068 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 607 transitions. [2025-02-06 03:15:34,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 607 transitions. [2025-02-06 03:15:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:34,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:34,070 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:34,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:15:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:34,271 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -989735039, now seen corresponding path program 1 times [2025-02-06 03:15:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622738580] [2025-02-06 03:15:34,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:34,274 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:34,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:15:34,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:34,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:34,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:15:34,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:34,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:34,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622738580] [2025-02-06 03:15:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622738580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:34,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926614299] [2025-02-06 03:15:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:34,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:34,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:34,688 INFO L87 Difference]: Start difference. First operand 452 states and 607 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:34,929 INFO L93 Difference]: Finished difference Result 818 states and 1092 transitions. [2025-02-06 03:15:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:15:34,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:34,931 INFO L225 Difference]: With dead ends: 818 [2025-02-06 03:15:34,931 INFO L226 Difference]: Without dead ends: 436 [2025-02-06 03:15:34,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 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:15:34,932 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 80 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:34,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 834 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-06 03:15:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 351. [2025-02-06 03:15:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 290 states have (on average 1.2517241379310344) internal successors, (363), 291 states have internal predecessors, (363), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:15:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 467 transitions. [2025-02-06 03:15:34,943 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 467 transitions. Word has length 180 [2025-02-06 03:15:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:34,943 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 467 transitions. [2025-02-06 03:15:34,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 467 transitions. [2025-02-06 03:15:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:15:34,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:34,944 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:34,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:15:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:35,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:35,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1517422464, now seen corresponding path program 1 times [2025-02-06 03:15:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:35,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627338354] [2025-02-06 03:15:35,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:35,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:35,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:35,148 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:35,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:15:35,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:15:35,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:15:35,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:35,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:35,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:15:35,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:35,584 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 14 treesize of output 10 [2025-02-06 03:15:35,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-02-06 03:15:36,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-02-06 03:15:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 45 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-02-06 03:15:36,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:37,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627338354] [2025-02-06 03:15:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627338354] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 03:15:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452546786] [2025-02-06 03:15:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:37,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:37,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:37,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:15:37,353 INFO L87 Difference]: Start difference. First operand 351 states and 467 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:37,647 INFO L93 Difference]: Finished difference Result 670 states and 890 transitions. [2025-02-06 03:15:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:15:37,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:15:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:37,650 INFO L225 Difference]: With dead ends: 670 [2025-02-06 03:15:37,650 INFO L226 Difference]: Without dead ends: 389 [2025-02-06 03:15:37,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:15:37,651 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 123 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:37,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 522 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:15:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-06 03:15:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 345. [2025-02-06 03:15:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 284 states have (on average 1.25) internal successors, (355), 285 states have internal predecessors, (355), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:15:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 459 transitions. [2025-02-06 03:15:37,677 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 459 transitions. Word has length 180 [2025-02-06 03:15:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 459 transitions. [2025-02-06 03:15:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 459 transitions. [2025-02-06 03:15:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-06 03:15:37,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:37,682 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:37,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-02-06 03:15:37,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:37,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:37,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1091105771, now seen corresponding path program 1 times [2025-02-06 03:15:37,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:37,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883571024] [2025-02-06 03:15:37,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:37,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:37,886 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:37,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-06 03:15:37,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 03:15:38,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 03:15:38,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:38,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:38,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:15:38,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:38,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:38,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:38,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883571024] [2025-02-06 03:15:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883571024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:38,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:15:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644565298] [2025-02-06 03:15:38,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:38,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:38,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:38,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:15:38,227 INFO L87 Difference]: Start difference. First operand 345 states and 459 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:38,278 INFO L93 Difference]: Finished difference Result 626 states and 833 transitions. [2025-02-06 03:15:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:15:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-02-06 03:15:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:38,284 INFO L225 Difference]: With dead ends: 626 [2025-02-06 03:15:38,284 INFO L226 Difference]: Without dead ends: 351 [2025-02-06 03:15:38,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:15:38,284 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:38,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-06 03:15:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-02-06 03:15:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 290 states have (on average 1.2448275862068965) internal successors, (361), 291 states have internal predecessors, (361), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:15:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 465 transitions. [2025-02-06 03:15:38,319 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 465 transitions. Word has length 182 [2025-02-06 03:15:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:38,319 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 465 transitions. [2025-02-06 03:15:38,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 465 transitions. [2025-02-06 03:15:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:15:38,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:38,324 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:38,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-06 03:15:38,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:38,524 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:38,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1407024813, now seen corresponding path program 1 times [2025-02-06 03:15:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743574672] [2025-02-06 03:15:38,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:38,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:38,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:15:38,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:15:39,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:15:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:39,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:15:39,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:39,142 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 8 treesize of output 1 [2025-02-06 03:15:39,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-02-06 03:15:40,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:40,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 40 [2025-02-06 03:15:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-02-06 03:15:40,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:15:41,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743574672] [2025-02-06 03:15:41,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743574672] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:41,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:41,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 19 [2025-02-06 03:15:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376513975] [2025-02-06 03:15:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:15:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:15:41,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:15:41,446 INFO L87 Difference]: Start difference. First operand 351 states and 465 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:45,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:47,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:51,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:51,505 INFO L93 Difference]: Finished difference Result 623 states and 818 transitions. [2025-02-06 03:15:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:15:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2025-02-06 03:15:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:51,507 INFO L225 Difference]: With dead ends: 623 [2025-02-06 03:15:51,507 INFO L226 Difference]: Without dead ends: 621 [2025-02-06 03:15:51,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:15:51,508 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 92 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:51,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1131 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 1 Unknown, 0 Unchecked, 9.8s Time] [2025-02-06 03:15:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-02-06 03:15:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2025-02-06 03:15:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 531 states have (on average 1.2523540489642184) internal successors, (665), 534 states have internal predecessors, (665), 73 states have call successors, (73), 13 states have call predecessors, (73), 13 states have return successors, (73), 70 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:15:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 811 transitions. [2025-02-06 03:15:51,523 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 811 transitions. Word has length 184 [2025-02-06 03:15:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:51,523 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 811 transitions. [2025-02-06 03:15:51,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:15:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 811 transitions. [2025-02-06 03:15:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:15:51,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:51,524 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:51,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-06 03:15:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:51,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash 318456084, now seen corresponding path program 1 times [2025-02-06 03:15:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599450078] [2025-02-06 03:15:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:51,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:51,728 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:51,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:15:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes.