./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:13:55,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:13:55,841 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:13:55,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:13:55,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:13:55,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:13:55,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:13:55,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:13:55,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:13:55,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:13:55,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:13:55,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:13:55,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:13:55,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:13:55,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:13:55,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:13:55,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:13:55,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:13:55,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:55,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:13:55,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:13:55,875 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2025-02-06 03:13:56,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:13:56,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:13:56,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:13:56,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:13:56,114 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:13:56,115 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-29.i [2025-02-06 03:13:57,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab45e11fd/e60028ea93e54ad5afb2e94375f55012/FLAG620fe3b57 [2025-02-06 03:13:57,638 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:13:57,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2025-02-06 03:13:57,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab45e11fd/e60028ea93e54ad5afb2e94375f55012/FLAG620fe3b57 [2025-02-06 03:13:57,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab45e11fd/e60028ea93e54ad5afb2e94375f55012 [2025-02-06 03:13:57,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:13:57,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:13:57,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:57,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:13:57,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:13:57,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:57,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57, skipping insertion in model container [2025-02-06 03:13:57,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:57,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:13:57,847 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-29.i[916,929] [2025-02-06 03:13:57,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:57,882 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:13:57,889 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-29.i[916,929] [2025-02-06 03:13:57,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:57,924 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:13:57,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57 WrapperNode [2025-02-06 03:13:57,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:57,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:57,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:13:57,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:13:57,931 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:13:57" (1/1) ... [2025-02-06 03:13:57,939 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:13:57" (1/1) ... [2025-02-06 03:13:57,962 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-02-06 03:13:57,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:57,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:13:57,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:13:57,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:13:57,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:57,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:57,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,004 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2025-02-06 03:13:58,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:13:58,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:13:58,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:13:58,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:13:58,034 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (1/1) ... [2025-02-06 03:13:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:58,056 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:13:58,058 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:13:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:13:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:13:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:13:58,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:13:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:13:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:13:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:13:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:13:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:13:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:13:58,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:13:58,167 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:13:58,168 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:13:58,460 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-02-06 03:13:58,498 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-06 03:13:58,498 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:13:58,505 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:13:58,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:13:58,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:58 BoogieIcfgContainer [2025-02-06 03:13:58,506 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:13:58,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:13:58,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:13:58,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:13:58,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:13:57" (1/3) ... [2025-02-06 03:13:58,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc0c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:58, skipping insertion in model container [2025-02-06 03:13:58,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:57" (2/3) ... [2025-02-06 03:13:58,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc0c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:58, skipping insertion in model container [2025-02-06 03:13:58,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:58" (3/3) ... [2025-02-06 03:13:58,512 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2025-02-06 03:13:58,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:13:58,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-29.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:13:58,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:13:58,585 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;@692934d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:13:58,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:13:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:13:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:13:58,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:58,595 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1118139219, now seen corresponding path program 1 times [2025-02-06 03:13:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016296513] [2025-02-06 03:13:58,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:58,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:13:58,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:13:58,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:58,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 03:13:58,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:58,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016296513] [2025-02-06 03:13:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016296513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:58,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403463320] [2025-02-06 03:13:58,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:58,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:13:58,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:58,778 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:13:58,802 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:13:58,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:13:58,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:13:58,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:58,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:13:58,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 03:13:58,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403463320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:58,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:13:58,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:13:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166412789] [2025-02-06 03:13:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:58,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:13:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:58,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:13:58,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:13:58,984 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:13:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:59,000 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2025-02-06 03:13:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:13:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-02-06 03:13:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:59,005 INFO L225 Difference]: With dead ends: 168 [2025-02-06 03:13:59,005 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 03:13:59,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:13:59,008 INFO L435 NwaCegarLoop]: 120 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, 120 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:13:59,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 03:13:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-06 03:13:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:13:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-02-06 03:13:59,036 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2025-02-06 03:13:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:59,036 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-02-06 03:13:59,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:13:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-02-06 03:13:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:13:59,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:59,039 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,045 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:13:59,243 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:13:59,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -311814391, now seen corresponding path program 1 times [2025-02-06 03:13:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657663708] [2025-02-06 03:13:59,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:59,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:13:59,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:13:59,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:59,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:13:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:59,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657663708] [2025-02-06 03:13:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657663708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:59,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541330115] [2025-02-06 03:13:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:59,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:59,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:59,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:59,465 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:13:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:59,498 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-02-06 03:13:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-02-06 03:13:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:59,500 INFO L225 Difference]: With dead ends: 167 [2025-02-06 03:13:59,500 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 03:13:59,501 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:13:59,501 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 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:13:59,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 03:13:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 03:13:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:13:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-02-06 03:13:59,512 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2025-02-06 03:13:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:59,512 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-02-06 03:13:59,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:13:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-02-06 03:13:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:13:59,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:59,513 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:13:59,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash -332151766, now seen corresponding path program 1 times [2025-02-06 03:13:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-02-06 03:13:59,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:13:59,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:13:59,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:59,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:13:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-02-06 03:13:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655082755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:59,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:59,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951361835] [2025-02-06 03:13:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:59,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:59,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:59,687 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:13:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:59,719 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2025-02-06 03:13:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-06 03:13:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:59,723 INFO L225 Difference]: With dead ends: 172 [2025-02-06 03:13:59,723 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:13:59,724 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:13:59,724 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 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:13:59,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:13:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-02-06 03:13:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:13:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2025-02-06 03:13:59,734 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 73 [2025-02-06 03:13:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:59,735 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2025-02-06 03:13:59,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:13:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2025-02-06 03:13:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:13:59,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:59,737 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:13:59,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:59,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash 555351915, now seen corresponding path program 1 times [2025-02-06 03:13:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:59,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449705537] [2025-02-06 03:13:59,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:13:59,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:13:59,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:59,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:13:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449705537] [2025-02-06 03:13:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449705537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733631777] [2025-02-06 03:13:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:59,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:59,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:59,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:59,892 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:13:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:59,918 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2025-02-06 03:13:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-06 03:13:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:59,923 INFO L225 Difference]: With dead ends: 176 [2025-02-06 03:13:59,923 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:59,923 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:13:59,924 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-02-06 03:13:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:13:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-02-06 03:13:59,929 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2025-02-06 03:13:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:59,930 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-02-06 03:13:59,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:13:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-02-06 03:13:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:13:59,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:59,931 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:13:59,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash 556275436, now seen corresponding path program 1 times [2025-02-06 03:13:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:59,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115511579] [2025-02-06 03:13:59,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:59,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:13:59,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:13:59,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:59,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:13:59,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:14:00,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:00,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:00,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:00,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:14:00,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:14:00,096 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:14:00,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:14:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:14:00,102 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 03:14:00,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:14:00,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:14:00 BoogieIcfgContainer [2025-02-06 03:14:00,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:14:00,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:14:00,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:14:00,164 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:14:00,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:58" (3/4) ... [2025-02-06 03:14:00,167 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:14:00,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:14:00,169 INFO L158 Benchmark]: Toolchain (without parser) took 2454.81ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 96.7MB in the end (delta: 9.7MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-02-06 03:14:00,170 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 226.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:00,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.26ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:14:00,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.56ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:00,170 INFO L158 Benchmark]: Boogie Preprocessor took 69.25ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 85.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:00,170 INFO L158 Benchmark]: IcfgBuilder took 472.93ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 55.7MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:14:00,170 INFO L158 Benchmark]: TraceAbstraction took 1656.24ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 96.8MB in the end (delta: -41.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-02-06 03:14:00,171 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 96.7MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:00,172 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.26ms. Allocated memory is still 226.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.26ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.56ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.25ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 85.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 472.93ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 55.7MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1656.24ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 96.8MB in the end (delta: -41.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 96.7MB in the end (delta: 37.0kB). 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 someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] float_Array_0[0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] float_Array_0[1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET updateVariables() [L87] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1] [L37] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L38] EXPR unsigned_char_Array_0[1] [L38] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L39] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND TRUE BOOL_unsigned_char_Array_0[0] [L40] EXPR float_Array_0[1] [L40] float_Array_0[2] = float_Array_0[1] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L46] COND FALSE !((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] [L51] signed long int stepLocal_0 = 5 * unsigned_char_Array_0[2]; [L52] EXPR float_Array_0[1] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[1] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=1270, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] COND FALSE !(((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) [L59] EXPR float_Array_0[2] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] COND TRUE float_Array_0[2] < float_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L87] RET step() [L88] CALL, EXPR property() [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR float_Array_0[2] [L78] EXPR float_Array_0[1] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78-L79] return (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1146 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 472 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 290/300 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:00,190 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-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:14:02,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:14:02,283 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:02,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:14:02,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:14:02,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:14:02,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:14:02,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:14:02,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:14:02,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:14:02,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:14:02,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:14:02,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:14:02,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:14:02,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:14:02,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:14:02,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:14:02,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:02,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:14:02,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:14:02,318 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2025-02-06 03:14:02,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:14:02,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:14:02,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:14:02,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:14:02,589 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:14:02,590 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-29.i [2025-02-06 03:14:03,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6e873ba6/ff44742ac432489c893c75b83d35add5/FLAG875169271 [2025-02-06 03:14:03,989 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:14:03,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2025-02-06 03:14:03,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6e873ba6/ff44742ac432489c893c75b83d35add5/FLAG875169271 [2025-02-06 03:14:04,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6e873ba6/ff44742ac432489c893c75b83d35add5 [2025-02-06 03:14:04,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:14:04,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:14:04,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:04,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:14:04,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:14:04,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:04" (1/1) ... [2025-02-06 03:14:04,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754c366f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:04, skipping insertion in model container [2025-02-06 03:14:04,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:04" (1/1) ... [2025-02-06 03:14:04,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:14:04,480 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-29.i[916,929] [2025-02-06 03:14:04,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:04,538 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:14:04,545 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-29.i[916,929] [2025-02-06 03:14:04,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:04,587 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:14:04,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:04 WrapperNode [2025-02-06 03:14:04,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:04,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:04,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:14:04,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:14:04,594 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:04" (1/1) ... [2025-02-06 03:14:04,604 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:04" (1/1) ... [2025-02-06 03:14:04,634 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-02-06 03:14:04,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:04,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:14:04,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:14:04,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:14:04,642 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:04" (1/1) ... [2025-02-06 03:14:04,643 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:04" (1/1) ... [2025-02-06 03:14:04,647 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:04" (1/1) ... [2025-02-06 03:14:04,667 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2025-02-06 03:14:04,668 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:04" (1/1) ... [2025-02-06 03:14:04,668 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:04" (1/1) ... [2025-02-06 03:14:04,692 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:04" (1/1) ... [2025-02-06 03:14:04,693 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:04" (1/1) ... [2025-02-06 03:14:04,695 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:04" (1/1) ... [2025-02-06 03:14:04,696 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:04" (1/1) ... [2025-02-06 03:14:04,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:14:04,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:14:04,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:14:04,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:14:04,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:04" (1/1) ... [2025-02-06 03:14:04,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:04,724 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:04,728 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:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:14:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:14:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:14:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:14:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:14:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:14:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:14:04,839 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:14:04,840 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:14:13,021 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-02-06 03:14:13,057 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-02-06 03:14:13,057 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:14:13,065 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:14:13,065 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:14:13,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:13 BoogieIcfgContainer [2025-02-06 03:14:13,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:14:13,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:14:13,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:14:13,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:14:13,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:14:04" (1/3) ... [2025-02-06 03:14:13,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c6836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:13, skipping insertion in model container [2025-02-06 03:14:13,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:04" (2/3) ... [2025-02-06 03:14:13,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c6836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:13, skipping insertion in model container [2025-02-06 03:14:13,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:13" (3/3) ... [2025-02-06 03:14:13,072 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2025-02-06 03:14:13,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:14:13,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-29.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:14:13,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:14:13,143 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;@273baded, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:14:13,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:14:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:14:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:13,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:13,152 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1118139219, now seen corresponding path program 1 times [2025-02-06 03:14:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216939115] [2025-02-06 03:14:13,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:13,163 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:14:13,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:13,167 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:14:13,173 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:14:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:13,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:13,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:13,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:13,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:14:13,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 03:14:13,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:13,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216939115] [2025-02-06 03:14:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216939115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:13,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:13,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:14:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772990275] [2025-02-06 03:14:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:13,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:14:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:13,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:14:13,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:14:13,505 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:14:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:13,519 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2025-02-06 03:14:13,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:14:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-02-06 03:14:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:13,524 INFO L225 Difference]: With dead ends: 168 [2025-02-06 03:14:13,524 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 03:14:13,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:13,527 INFO L435 NwaCegarLoop]: 120 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, 120 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:13,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 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:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 03:14:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-06 03:14:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:14:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-02-06 03:14:13,550 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2025-02-06 03:14:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:13,550 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-02-06 03:14:13,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:14:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-02-06 03:14:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:13,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:13,552 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,563 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:14:13,753 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:14:13,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -311814391, now seen corresponding path program 1 times [2025-02-06 03:14:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115778204] [2025-02-06 03:14:13,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:13,755 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:14:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:13,757 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:14:13,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 (3)] Waiting until timeout for monitored process [2025-02-06 03:14:13,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:14,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:14,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:14,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:14,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:14:14,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:14:14,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:14,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:14,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115778204] [2025-02-06 03:14:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115778204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:14,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:14:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342446236] [2025-02-06 03:14:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:14,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:14,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:14:14,135 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:14:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:14,206 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-02-06 03:14:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-02-06 03:14:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:14,208 INFO L225 Difference]: With dead ends: 167 [2025-02-06 03:14:14,209 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 03:14:14,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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:14,210 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 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:14:14,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 03:14:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 03:14:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:14:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-02-06 03:14:14,221 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2025-02-06 03:14:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:14,221 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-02-06 03:14:14,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:14:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-02-06 03:14:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:14,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:14,224 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,236 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:14:14,425 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:14:14,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:14,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash -332151766, now seen corresponding path program 1 times [2025-02-06 03:14:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:14,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140162383] [2025-02-06 03:14:14,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:14,428 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:14:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:14,434 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:14:14,436 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:14:14,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:14,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:14,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:14,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:14,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:14:14,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:14:14,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:14,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140162383] [2025-02-06 03:14:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140162383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:14,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789676612] [2025-02-06 03:14:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:14,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:14,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:14,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:14,786 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:14,926 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2025-02-06 03:14:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-06 03:14:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:14,931 INFO L225 Difference]: With dead ends: 176 [2025-02-06 03:14:14,931 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:14:14,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:14,932 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:14,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:14:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-02-06 03:14:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:14:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-02-06 03:14:14,941 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2025-02-06 03:14:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:14,941 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-02-06 03:14:14,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-02-06 03:14:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:14,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:14,945 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,957 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:14:15,150 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:14:15,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:15,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 555351915, now seen corresponding path program 1 times [2025-02-06 03:14:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212575464] [2025-02-06 03:14:15,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:15,151 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:14:15,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:15,153 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:14:15,155 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:14:15,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:15,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:15,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:15,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:15,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:14:15,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:14:15,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:15,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212575464] [2025-02-06 03:14:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212575464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:15,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:15,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033284627] [2025-02-06 03:14:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:15,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:15,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:15,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:15,514 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:15,651 INFO L93 Difference]: Finished difference Result 184 states and 257 transitions. [2025-02-06 03:14:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-06 03:14:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:15,653 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:14:15,653 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:14:15,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:15,654 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:15,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:14:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-02-06 03:14:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 03:14:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2025-02-06 03:14:15,660 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 73 [2025-02-06 03:14:15,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:15,664 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2025-02-06 03:14:15,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2025-02-06 03:14:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:15,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:15,665 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,677 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 (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:15,865 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:14:15,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 556275436, now seen corresponding path program 1 times [2025-02-06 03:14:15,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:15,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563787613] [2025-02-06 03:14:15,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:15,867 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:14:15,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:15,875 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:14:15,876 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:14:15,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:16,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:16,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:16,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:14:16,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:16,807 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 131 treesize of output 67 [2025-02-06 03:14:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:14:17,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:14:17,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563787613] [2025-02-06 03:14:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563787613] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:17,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 03:14:17,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246923054] [2025-02-06 03:14:17,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:17,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:17,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:17,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:14:17,337 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:17,929 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2025-02-06 03:14:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-06 03:14:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:17,935 INFO L225 Difference]: With dead ends: 260 [2025-02-06 03:14:17,935 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 03:14:17,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:14:17,936 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 165 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:17,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:14:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 03:14:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2025-02-06 03:14:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.37012987012987) internal successors, (211), 155 states have internal predecessors, (211), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:14:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 229 transitions. [2025-02-06 03:14:17,943 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 229 transitions. Word has length 73 [2025-02-06 03:14:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:17,943 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 229 transitions. [2025-02-06 03:14:17,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2025-02-06 03:14:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:17,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:17,944 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,966 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:14:18,145 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:14:18,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1909585133, now seen corresponding path program 1 times [2025-02-06 03:14:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527237177] [2025-02-06 03:14:18,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:18,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:14:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:18,148 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:14:18,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 (7)] Waiting until timeout for monitored process [2025-02-06 03:14:18,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:18,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:18,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:18,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:14:18,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:18,623 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:14:19,063 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 131 treesize of output 67 [2025-02-06 03:14:19,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:19,183 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 166 treesize of output 58 [2025-02-06 03:14:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:14:19,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:14:19,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527237177] [2025-02-06 03:14:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527237177] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:19,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-02-06 03:14:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435528728] [2025-02-06 03:14:19,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:19,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:19,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:19,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:14:19,428 INFO L87 Difference]: Start difference. First operand 166 states and 229 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:19,871 INFO L93 Difference]: Finished difference Result 416 states and 570 transitions. [2025-02-06 03:14:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-06 03:14:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:19,877 INFO L225 Difference]: With dead ends: 416 [2025-02-06 03:14:19,877 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 03:14:19,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:14:19,879 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 88 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:19,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 273 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:14:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 03:14:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 166. [2025-02-06 03:14:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 155 states have internal predecessors, (210), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:14:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2025-02-06 03:14:19,900 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 73 [2025-02-06 03:14:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:19,901 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2025-02-06 03:14:19,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:14:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2025-02-06 03:14:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:19,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:19,901 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,922 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:14:20,102 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:14:20,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2120936046, now seen corresponding path program 1 times [2025-02-06 03:14:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212907555] [2025-02-06 03:14:20,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:20,105 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:14:20,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:20,108 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:14:20,110 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:14:20,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:20,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:20,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:20,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:20,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:14:20,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:20,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 131 treesize of output 67 [2025-02-06 03:14:21,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:21,031 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 166 treesize of output 58 [2025-02-06 03:14:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:14:21,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:21,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212907555] [2025-02-06 03:14:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212907555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [54311024] [2025-02-06 03:14:21,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:14:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:14:21,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:14:21,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-02-06 03:14:21,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:22,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:22,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:22,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:22,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:14:22,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:22,509 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 101 treesize of output 55 [2025-02-06 03:14:22,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:22,686 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 136 treesize of output 46 [2025-02-06 03:14:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:14:22,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [54311024] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:22,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:14:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-02-06 03:14:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715586007] [2025-02-06 03:14:22,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:14:22,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:14:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:22,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:14:22,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:14:22,889 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 03:14:26,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:29,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:31,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:35,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:38,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:41,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:44,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:48,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:52,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:53,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:54,969 INFO L93 Difference]: Finished difference Result 558 states and 765 transitions. [2025-02-06 03:14:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:14:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2025-02-06 03:14:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:54,971 INFO L225 Difference]: With dead ends: 558 [2025-02-06 03:14:54,973 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 03:14:54,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:14:54,974 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 566 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:54,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 972 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 31.5s Time] [2025-02-06 03:14:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 03:14:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 259. [2025-02-06 03:14:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 242 states have internal predecessors, (328), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:14:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 358 transitions. [2025-02-06 03:14:54,995 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 358 transitions. Word has length 73 [2025-02-06 03:14:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:54,995 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 358 transitions. [2025-02-06 03:14:54,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 03:14:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 358 transitions. [2025-02-06 03:14:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 03:14:54,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:54,996 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,006 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 (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:55,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:55,405 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,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:14:55,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:55,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -203091793, now seen corresponding path program 1 times [2025-02-06 03:14:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:55,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101513683] [2025-02-06 03:14:55,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:55,406 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:14:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:55,411 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:14:55,412 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:14:55,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 03:14:55,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 03:14:55,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:55,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:14:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:14:55,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:55,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101513683] [2025-02-06 03:14:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101513683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:55,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:55,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:14:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594213151] [2025-02-06 03:14:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:55,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:55,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:55,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:14:55,690 INFO L87 Difference]: Start difference. First operand 259 states and 358 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:14:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:55,754 INFO L93 Difference]: Finished difference Result 515 states and 713 transitions. [2025-02-06 03:14:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-02-06 03:14:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:55,756 INFO L225 Difference]: With dead ends: 515 [2025-02-06 03:14:55,756 INFO L226 Difference]: Without dead ends: 259 [2025-02-06 03:14:55,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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:55,759 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:55,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-06 03:14:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-02-06 03:14:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3625) internal successors, (327), 242 states have internal predecessors, (327), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:14:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2025-02-06 03:14:55,771 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 73 [2025-02-06 03:14:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:55,771 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2025-02-06 03:14:55,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 03:14:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2025-02-06 03:14:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:14:55,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:55,772 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,781 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:14:55,974 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:14:55,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1718411053, now seen corresponding path program 1 times [2025-02-06 03:14:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:55,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22719766] [2025-02-06 03:14:55,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:55,975 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:14:55,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:55,977 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:14:55,978 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:14:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:14:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:14:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:56,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:14:56,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:56,396 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:14:56,822 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 131 treesize of output 67 [2025-02-06 03:14:57,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:57,303 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 224 treesize of output 80 [2025-02-06 03:14:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:14:57,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:14:58,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22719766] [2025-02-06 03:14:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22719766] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2025-02-06 03:14:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155213994] [2025-02-06 03:14:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:58,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:14:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:58,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:14:58,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:14:58,379 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:15:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:00,868 INFO L93 Difference]: Finished difference Result 670 states and 915 transitions. [2025-02-06 03:15:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:15:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2025-02-06 03:15:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:00,871 INFO L225 Difference]: With dead ends: 670 [2025-02-06 03:15:00,871 INFO L226 Difference]: Without dead ends: 414 [2025-02-06 03:15:00,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:15:00,873 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 444 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:00,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 769 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 309 Invalid, 2 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 03:15:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-06 03:15:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 269. [2025-02-06 03:15:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 250 states have (on average 1.364) internal successors, (341), 252 states have internal predecessors, (341), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:15:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2025-02-06 03:15:00,886 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 74 [2025-02-06 03:15:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2025-02-06 03:15:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 03:15:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2025-02-06 03:15:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:15:00,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:00,888 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,897 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 (11)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:01,089 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:01,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash 712871703, now seen corresponding path program 1 times [2025-02-06 03:15:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:01,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432800532] [2025-02-06 03:15:01,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:01,091 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:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:01,093 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:01,093 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:01,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:15:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:15:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:01,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:15:01,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:01,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2025-02-06 03:15:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 03:15:02,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 03:15:02,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432800532] [2025-02-06 03:15:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432800532] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:15:02,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:15:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2025-02-06 03:15:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657110278] [2025-02-06 03:15:02,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:15:02,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:15:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:02,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:15:02,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:15:02,385 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-06 03:15:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:02,756 INFO L93 Difference]: Finished difference Result 401 states and 538 transitions. [2025-02-06 03:15:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:15:02,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2025-02-06 03:15:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:02,758 INFO L225 Difference]: With dead ends: 401 [2025-02-06 03:15:02,758 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:15:02,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:15:02,759 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 411 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:02,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 768 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:15:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-02-06 03:15:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:15:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2025-02-06 03:15:02,768 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 74 [2025-02-06 03:15:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:02,768 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2025-02-06 03:15:02,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-06 03:15:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2025-02-06 03:15:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 03:15:02,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:02,769 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,779 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 (12)] Ended with exit code 0 [2025-02-06 03:15:02,969 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:02,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash -101956052, now seen corresponding path program 1 times [2025-02-06 03:15:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707435813] [2025-02-06 03:15:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:02,971 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:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:02,974 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:02,975 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:03,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 03:15:03,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 03:15:03,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:03,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:03,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:15:03,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:04,203 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 129 treesize of output 65 [2025-02-06 03:15:04,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:04,463 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 164 treesize of output 56 [2025-02-06 03:15:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:15:04,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:04,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707435813] [2025-02-06 03:15:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707435813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1654931618] [2025-02-06 03:15:04,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:04,898 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:15:04,901 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:15:04,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-02-06 03:15:05,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 03:15:05,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 03:15:05,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:05,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:05,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:15:05,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:06,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 46 [2025-02-06 03:15:06,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:06,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 45 [2025-02-06 03:15:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:15:06,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1654931618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:06,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:15:06,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2025-02-06 03:15:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950860891] [2025-02-06 03:15:06,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:15:06,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:15:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:06,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:15:06,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:15:06,937 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 23 states, 21 states have (on average 4.285714285714286) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-06 03:15:10,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:13,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:16,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:15:19,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:23,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:25,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:30,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:32,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:34,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:38,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:40,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:40,782 INFO L93 Difference]: Finished difference Result 394 states and 487 transitions. [2025-02-06 03:15:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:15:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.285714285714286) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2025-02-06 03:15:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:40,784 INFO L225 Difference]: With dead ends: 394 [2025-02-06 03:15:40,784 INFO L226 Difference]: Without dead ends: 266 [2025-02-06 03:15:40,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 03:15:40,785 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 791 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:40,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1098 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1053 Invalid, 1 Unknown, 0 Unchecked, 32.6s Time] [2025-02-06 03:15:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-06 03:15:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 145. [2025-02-06 03:15:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.24) internal successors, (155), 126 states have internal predecessors, (155), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:15:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2025-02-06 03:15:40,793 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 75 [2025-02-06 03:15:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:40,793 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2025-02-06 03:15:40,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.285714285714286) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-06 03:15:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2025-02-06 03:15:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 03:15:40,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:40,794 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,806 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:41,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-02-06 03:15:41,199 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,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:41,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1285303349, now seen corresponding path program 1 times [2025-02-06 03:15:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732770518] [2025-02-06 03:15:41,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:41,201 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:41,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:41,203 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:41,204 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:41,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 03:15:41,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 03:15:41,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:15:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 03:15:41,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:41,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732770518] [2025-02-06 03:15:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732770518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835930911] [2025-02-06 03:15:41,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:41,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:41,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:41,558 INFO L87 Difference]: Start difference. First operand 145 states and 179 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 03:15:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:41,713 INFO L93 Difference]: Finished difference Result 272 states and 334 transitions. [2025-02-06 03:15:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:15:41,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2025-02-06 03:15:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:41,718 INFO L225 Difference]: With dead ends: 272 [2025-02-06 03:15:41,718 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:15:41,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:15:41,718 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:41,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:15:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-02-06 03:15:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 105 states have internal predecessors, (129), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:15:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2025-02-06 03:15:41,724 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 75 [2025-02-06 03:15:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:41,725 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2025-02-06 03:15:41,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 03:15:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2025-02-06 03:15:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 03:15:41,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:41,725 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,734 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:41,927 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:41,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1953789587, now seen corresponding path program 1 times [2025-02-06 03:15:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:41,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669846485] [2025-02-06 03:15:41,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:41,928 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:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:41,931 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:41,932 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:42,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 03:15:42,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 03:15:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:42,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:15:42,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:42,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 03:15:42,399 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 69 treesize of output 51 [2025-02-06 03:15:42,404 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 51 treesize of output 33 [2025-02-06 03:15:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:15:42,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:42,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669846485] [2025-02-06 03:15:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669846485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:42,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853125013] [2025-02-06 03:15:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:42,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:42,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:42,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:42,443 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)