./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.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-26.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 c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:13:32,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:13:32,940 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:32,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:13:32,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:13:32,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:13:32,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:13:32,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:13:32,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:13:32,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:13:32,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:13:32,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:13:32,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:13:32,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:13:32,973 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:13:32,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:13:32,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:13:32,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:13:32,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:13:32,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:13:32,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:13:32,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:13:32,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:32,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:13:32,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:13:32,976 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 -> c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e [2025-02-06 03:13:33,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:13:33,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:13:33,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:13:33,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:13:33,218 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:13:33,219 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-26.i [2025-02-06 03:13:34,393 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54ffe4700/8734dd7fbb294434b46681d5560cf369/FLAG9fdcdfdd8 [2025-02-06 03:13:34,617 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:13:34,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2025-02-06 03:13:34,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54ffe4700/8734dd7fbb294434b46681d5560cf369/FLAG9fdcdfdd8 [2025-02-06 03:13:34,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54ffe4700/8734dd7fbb294434b46681d5560cf369 [2025-02-06 03:13:34,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:13:34,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:13:34,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:34,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:13:34,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:13:34,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:34" (1/1) ... [2025-02-06 03:13:34,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716c313f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:34, skipping insertion in model container [2025-02-06 03:13:34,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:34" (1/1) ... [2025-02-06 03:13:34,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:13:34,772 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-26.i[916,929] [2025-02-06 03:13:34,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:34,836 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:13:34,843 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-26.i[916,929] [2025-02-06 03:13:34,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:34,880 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:13:34,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:34 WrapperNode [2025-02-06 03:13:34,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:34,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:34,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:13:34,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:13:34,886 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:34" (1/1) ... [2025-02-06 03:13:34,898 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:34" (1/1) ... [2025-02-06 03:13:34,927 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-02-06 03:13:34,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:34,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:13:34,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:13:34,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:13:34,941 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:34" (1/1) ... [2025-02-06 03:13:34,941 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:34" (1/1) ... [2025-02-06 03:13:34,948 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:34" (1/1) ... [2025-02-06 03:13:34,967 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2025-02-06 03:13:34,967 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:34" (1/1) ... [2025-02-06 03:13:34,968 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:34" (1/1) ... [2025-02-06 03:13:34,980 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:34" (1/1) ... [2025-02-06 03:13:34,981 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:34" (1/1) ... [2025-02-06 03:13:34,983 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:34" (1/1) ... [2025-02-06 03:13:34,991 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:34" (1/1) ... [2025-02-06 03:13:34,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:13:34,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:13:34,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:13:34,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:13:34,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:34" (1/1) ... [2025-02-06 03:13:35,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:35,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:35,027 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:35,030 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:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:13:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:13:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:13:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:13:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:13:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:13:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:13:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:13:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:13:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:13:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:13:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:13:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:13:35,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:13:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:13:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:13:35,160 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:13:35,162 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:13:35,566 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#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~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 03:13:35,608 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-02-06 03:13:35,609 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:13:35,616 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:13:35,618 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:13:35,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:35 BoogieIcfgContainer [2025-02-06 03:13:35,619 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:13:35,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:13:35,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:13:35,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:13:35,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:13:34" (1/3) ... [2025-02-06 03:13:35,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a39e3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:35, skipping insertion in model container [2025-02-06 03:13:35,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:34" (2/3) ... [2025-02-06 03:13:35,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a39e3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:35, skipping insertion in model container [2025-02-06 03:13:35,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:35" (3/3) ... [2025-02-06 03:13:35,628 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-26.i [2025-02-06 03:13:35,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:13:35,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:13:35,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:13:35,703 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;@661406e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:13:35,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:13:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:35,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:35,718 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:35,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1625187196, now seen corresponding path program 1 times [2025-02-06 03:13:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279477442] [2025-02-06 03:13:35,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:35,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:35,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:35,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 03:13:35,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279477442] [2025-02-06 03:13:35,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279477442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:13:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420766292] [2025-02-06 03:13:35,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:35,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:13:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:35,967 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:35,969 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:36,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:36,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:36,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:36,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:36,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:13:36,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 03:13:36,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420766292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:36,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:13:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:13:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779804599] [2025-02-06 03:13:36,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:36,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:13:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:36,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:13:36,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:13:36,231 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:13:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:36,252 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-02-06 03:13:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:13:36,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-02-06 03:13:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:36,259 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:13:36,259 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:13:36,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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:36,263 INFO L435 NwaCegarLoop]: 127 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, 127 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:36,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 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:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:13:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:13:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-02-06 03:13:36,290 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-02-06 03:13:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:36,291 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-02-06 03:13:36,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:13:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-02-06 03:13:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:36,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:36,293 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,300 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:36,493 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:36,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:36,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 412394933, now seen corresponding path program 1 times [2025-02-06 03:13:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922825875] [2025-02-06 03:13:36,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:36,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:36,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:36,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:36,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922825875] [2025-02-06 03:13:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922825875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311202499] [2025-02-06 03:13:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:36,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:36,759 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:36,797 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2025-02-06 03:13:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:13:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:36,799 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:13:36,799 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:13:36,799 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:36,800 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:36,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:13:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-02-06 03:13:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-02-06 03:13:36,806 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-02-06 03:13:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:36,807 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-02-06 03:13:36,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-02-06 03:13:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:36,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:36,808 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:13:36,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:36,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash 413318454, now seen corresponding path program 1 times [2025-02-06 03:13:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:36,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123249027] [2025-02-06 03:13:36,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:36,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:36,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:36,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123249027] [2025-02-06 03:13:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123249027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:37,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:37,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194293957] [2025-02-06 03:13:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:37,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:37,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:37,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:37,136 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:37,239 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2025-02-06 03:13:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:37,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:13:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:37,244 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:13:37,248 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:37,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:37,250 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:37,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:13:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-02-06 03:13:37,256 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2025-02-06 03:13:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:37,256 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-02-06 03:13:37,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-02-06 03:13:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:37,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:37,258 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:13:37,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:37,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash 4494229, now seen corresponding path program 1 times [2025-02-06 03:13:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806465342] [2025-02-06 03:13:37,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:37,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:37,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:37,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:37,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:13:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806465342] [2025-02-06 03:13:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806465342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:37,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299037694] [2025-02-06 03:13:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:37,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:13:37,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:37,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:37,443 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:37,516 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2025-02-06 03:13:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:13:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:37,519 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:13:37,519 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:37,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:37,520 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:37,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:13:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2025-02-06 03:13:37,529 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 89 [2025-02-06 03:13:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:37,530 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2025-02-06 03:13:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2025-02-06 03:13:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:37,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:37,531 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:13:37,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:37,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash -501064396, now seen corresponding path program 1 times [2025-02-06 03:13:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:13:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213751389] [2025-02-06 03:13:37,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:13:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:37,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:37,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:37,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:13:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542229764] [2025-02-06 03:13:37,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:37,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:13:37,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:37,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:13:37,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:13:37,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:37,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:37,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:37,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:13:37,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:13:37,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:38,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:38,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:38,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:13:38,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:13:38,075 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:13:38,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:13:38,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:38,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:13:38,280 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 03:13:38,342 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:13:38,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:13:38 BoogieIcfgContainer [2025-02-06 03:13:38,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:13:38,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:13:38,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:13:38,345 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:13:38,345 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:35" (3/4) ... [2025-02-06 03:13:38,347 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:13:38,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:13:38,349 INFO L158 Benchmark]: Toolchain (without parser) took 3703.33ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 59.7MB in the end (delta: 62.6MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2025-02-06 03:13:38,349 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:13:38,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.14ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:13:38,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.72ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:13:38,351 INFO L158 Benchmark]: Boogie Preprocessor took 62.44ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 97.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:13:38,351 INFO L158 Benchmark]: IcfgBuilder took 621.47ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 63.0MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:13:38,351 INFO L158 Benchmark]: TraceAbstraction took 2723.41ms. Allocated memory is still 167.8MB. Free memory was 62.5MB in the beginning and 59.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-02-06 03:13:38,351 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:13:38,352 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.27ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.14ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.72ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.44ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 97.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 621.47ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 63.0MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2723.41ms. Allocated memory is still 167.8MB. Free memory was 62.5MB in the beginning and 59.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 46.1kB). 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 60, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -32 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -32 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 64; VAL [float_Array_0={4:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] CALL updateLastVariables() [L73] EXPR unsigned_char_Array_0[1] [L73] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L57] float_Array_0[0][1] = __VERIFIER_nondet_float() [L58] EXPR float_Array_0[0][1] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L58] EXPR float_Array_0[0][1] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] float_Array_0[1][1] = __VERIFIER_nondet_float() [L60] EXPR float_Array_0[1][1] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F [L60] EXPR float_Array_0[1][1] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] CALL assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] RET assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L61] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L62] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L65] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L66] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET updateVariables() [L85] CALL step() [L41] EXPR float_Array_0[0][1] [L41] EXPR float_Array_0[1][1] [L41] float_Array_0[1][0] = ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]) [L42] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L42] COND TRUE (- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4)))) [L43] EXPR unsigned_char_Array_0[0] [L43] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L45] EXPR float_Array_0[0][1] [L45] float_Array_0[0][0] = float_Array_0[0][1] [L46] EXPR float_Array_0[0][0] [L46] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND TRUE float_Array_0[0][0] > float_Array_0[0][0] [L47] EXPR unsigned_char_Array_0[1] [L47] EXPR unsigned_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L47] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) [L47] EXPR unsigned_char_Array_0[1] [L47] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L47] signed_short_int_Array_0[1] = ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_short_int_Array_0[1] [L51] signed long int stepLocal_0 = unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1]); [L52] EXPR unsigned_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[1] [L52] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) [L85] RET step() [L86] CALL, EXPR property() [L76] EXPR float_Array_0[0][0] [L76] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))))) [L76] EXPR signed_short_int_Array_0[1] [L76] EXPR unsigned_char_Array_0[1] [L76] EXPR unsigned_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) [L76] EXPR unsigned_char_Array_0[1] [L76] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) [L76] EXPR float_Array_0[1][0] [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[1][1] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76-L77] return (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 899 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 399 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 500 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 704/720 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:13:38,369 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-26.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 c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:13:40,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:13:40,300 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:13:40,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:13:40,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:13:40,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:13:40,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:13:40,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:13:40,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:13:40,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:13:40,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:13:40,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:13:40,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:13:40,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:13:40,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:13:40,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:13:40,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:40,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:13:40,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:13:40,342 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:13:40,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:13:40,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:13:40,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:13:40,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:13:40,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:13:40,342 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 -> c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e [2025-02-06 03:13:40,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:13:40,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:13:40,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:13:40,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:13:40,581 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:13:40,582 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-26.i [2025-02-06 03:13:41,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46904bbc/049e8bf1d1c0428ebd5936d6cdfce760/FLAG49d90926b [2025-02-06 03:13:41,973 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:13:41,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2025-02-06 03:13:41,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46904bbc/049e8bf1d1c0428ebd5936d6cdfce760/FLAG49d90926b [2025-02-06 03:13:42,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46904bbc/049e8bf1d1c0428ebd5936d6cdfce760 [2025-02-06 03:13:42,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:13:42,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:13:42,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:42,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:13:42,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:13:42,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:42" (1/1) ... [2025-02-06 03:13:42,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7610d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:42, skipping insertion in model container [2025-02-06 03:13:42,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:42" (1/1) ... [2025-02-06 03:13:42,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:13:42,420 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-26.i[916,929] [2025-02-06 03:13:42,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:42,503 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:13:42,512 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-26.i[916,929] [2025-02-06 03:13:42,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:42,568 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:13:42,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:42 WrapperNode [2025-02-06 03:13:42,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:42,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:42,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:13:42,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:13:42,576 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:42" (1/1) ... [2025-02-06 03:13:42,589 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:42" (1/1) ... [2025-02-06 03:13:42,623 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-02-06 03:13:42,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:42,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:13:42,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:13:42,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:13:42,632 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:42" (1/1) ... [2025-02-06 03:13:42,632 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:42" (1/1) ... [2025-02-06 03:13:42,639 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:42" (1/1) ... [2025-02-06 03:13:42,667 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2025-02-06 03:13:42,667 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:42" (1/1) ... [2025-02-06 03:13:42,667 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:42" (1/1) ... [2025-02-06 03:13:42,682 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:42" (1/1) ... [2025-02-06 03:13:42,684 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:42" (1/1) ... [2025-02-06 03:13:42,687 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:42" (1/1) ... [2025-02-06 03:13:42,689 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:42" (1/1) ... [2025-02-06 03:13:42,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:13:42,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:13:42,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:13:42,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:13:42,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:42" (1/1) ... [2025-02-06 03:13:42,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:42,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:42,727 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:42,730 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:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:13:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:13:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:13:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:13:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:13:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:13:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:13:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:13:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:13:42,916 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:13:42,917 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:13:43,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#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~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 03:13:43,867 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-02-06 03:13:43,867 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:13:43,877 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:13:43,877 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:13:43,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:43 BoogieIcfgContainer [2025-02-06 03:13:43,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:13:43,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:13:43,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:13:43,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:13:43,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:13:42" (1/3) ... [2025-02-06 03:13:43,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a5afa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:43, skipping insertion in model container [2025-02-06 03:13:43,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:42" (2/3) ... [2025-02-06 03:13:43,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a5afa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:43, skipping insertion in model container [2025-02-06 03:13:43,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:43" (3/3) ... [2025-02-06 03:13:43,887 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-26.i [2025-02-06 03:13:43,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:13:43,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:13:43,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:13:43,946 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;@3c87ace0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:13:43,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:13:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:43,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:43,957 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:43,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1625187196, now seen corresponding path program 1 times [2025-02-06 03:13:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010236599] [2025-02-06 03:13:43,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:43,969 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:13:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:43,976 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:13:43,977 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:13:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:44,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:44,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:44,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:44,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:13:44,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 03:13:44,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:44,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:44,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010236599] [2025-02-06 03:13:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010236599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:44,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:13:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455472715] [2025-02-06 03:13:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:13:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:44,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:13:44,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:13:44,343 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:44,359 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-02-06 03:13:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:13:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:13:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:44,364 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:13:44,364 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:13:44,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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:44,368 INFO L435 NwaCegarLoop]: 127 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, 127 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:44,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 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:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:13:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:13:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-02-06 03:13:44,394 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-02-06 03:13:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:44,394 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-02-06 03:13:44,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-02-06 03:13:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:44,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:44,397 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,406 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:13:44,597 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:13:44,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 412394933, now seen corresponding path program 1 times [2025-02-06 03:13:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612326469] [2025-02-06 03:13:44,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:44,600 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:13:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:44,602 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:13:44,603 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:13:44,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:44,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:44,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:44,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:44,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:13:44,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:44,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:44,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612326469] [2025-02-06 03:13:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612326469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608094196] [2025-02-06 03:13:44,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:44,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:44,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:44,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:44,980 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:45,045 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2025-02-06 03:13:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:13:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:13:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:45,049 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:13:45,049 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:13:45,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:45,049 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:45,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:13:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-06 03:13:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-02-06 03:13:45,059 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 89 [2025-02-06 03:13:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-02-06 03:13:45,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-02-06 03:13:45,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:13:45,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:45,061 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,072 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:13:45,264 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:13:45,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:45,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 413318454, now seen corresponding path program 1 times [2025-02-06 03:13:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:45,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588934974] [2025-02-06 03:13:45,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:45,265 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:13:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:45,267 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:13:45,268 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:13:45,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:13:45,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:13:45,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:45,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:45,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:13:45,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:45,661 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 95 treesize of output 41 [2025-02-06 03:13:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:45,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:45,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588934974] [2025-02-06 03:13:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588934974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:45,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101000923] [2025-02-06 03:13:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:45,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:45,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:45,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:45,696 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:46,418 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2025-02-06 03:13:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:13:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:13:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:46,420 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:13:46,420 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:13:46,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:13:46,421 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 122 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:46,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 434 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:13:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:13:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-06 03:13:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-02-06 03:13:46,426 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2025-02-06 03:13:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:46,426 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-02-06 03:13:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-02-06 03:13:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 03:13:46,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:46,430 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,442 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:13:46,631 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:13:46,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 504841592, now seen corresponding path program 1 times [2025-02-06 03:13:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807108895] [2025-02-06 03:13:46,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:46,632 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:13:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:46,634 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:13:46,635 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:13:46,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 03:13:46,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 03:13:46,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:46,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:46,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:46,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:46,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:13:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:46,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:46,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:46,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807108895] [2025-02-06 03:13:46,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807108895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:46,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:46,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704944939] [2025-02-06 03:13:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:46,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:46,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:46,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:46,985 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:47,204 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2025-02-06 03:13:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-02-06 03:13:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:47,206 INFO L225 Difference]: With dead ends: 183 [2025-02-06 03:13:47,206 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:13:47,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:47,207 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:47,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:13:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:13:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-02-06 03:13:47,215 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 91 [2025-02-06 03:13:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:47,215 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-02-06 03:13:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-02-06 03:13:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 03:13:47,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:47,218 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:13:47,418 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:13:47,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:47,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 96017367, now seen corresponding path program 1 times [2025-02-06 03:13:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922215092] [2025-02-06 03:13:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:47,419 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:13:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:47,422 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:13:47,423 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:13:47,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 03:13:47,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 03:13:47,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:47,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:47,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:47,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:47,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:13:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:47,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:47,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922215092] [2025-02-06 03:13:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922215092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466480181] [2025-02-06 03:13:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:47,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:47,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:47,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:47,751 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:47,769 INFO L93 Difference]: Finished difference Result 183 states and 255 transitions. [2025-02-06 03:13:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-02-06 03:13:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:47,770 INFO L225 Difference]: With dead ends: 183 [2025-02-06 03:13:47,770 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:13:47,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:47,771 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:47,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:13:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:13:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-02-06 03:13:47,776 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 91 [2025-02-06 03:13:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:47,776 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-02-06 03:13:47,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2025-02-06 03:13:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 03:13:47,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:47,781 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,791 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 (6)] Ended with exit code 0 [2025-02-06 03:13:47,981 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:13:47,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -409541258, now seen corresponding path program 1 times [2025-02-06 03:13:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262842230] [2025-02-06 03:13:47,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:47,982 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:13:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:47,984 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:13:47,985 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:13:48,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 03:13:48,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 03:13:48,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:48,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:48,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:48,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:48,291 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 43 treesize of output 19 [2025-02-06 03:13:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:48,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:48,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262842230] [2025-02-06 03:13:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262842230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255539349] [2025-02-06 03:13:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:48,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:48,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:48,309 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:48,536 INFO L93 Difference]: Finished difference Result 181 states and 251 transitions. [2025-02-06 03:13:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-02-06 03:13:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:48,538 INFO L225 Difference]: With dead ends: 181 [2025-02-06 03:13:48,538 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:48,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:48,539 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:48,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:13:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:13:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-02-06 03:13:48,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 91 [2025-02-06 03:13:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:48,548 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-02-06 03:13:48,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-02-06 03:13:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:13:48,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:48,551 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,560 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:13:48,751 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:13:48,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:48,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1840215084, now seen corresponding path program 1 times [2025-02-06 03:13:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714423957] [2025-02-06 03:13:48,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:48,752 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:13:48,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:48,754 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:13:48,755 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:13:48,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:13:49,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:13:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:49,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:13:49,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:49,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:49,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714423957] [2025-02-06 03:13:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714423957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:49,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099019572] [2025-02-06 03:13:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:49,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:49,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:49,098 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:49,531 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2025-02-06 03:13:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:49,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:13:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:49,533 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:13:49,533 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:49,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:49,533 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:49,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:13:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:13:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2025-02-06 03:13:49,537 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 96 [2025-02-06 03:13:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:49,538 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2025-02-06 03:13:49,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2025-02-06 03:13:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:13:49,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:49,538 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:13:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:49,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:49,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash -236994259, now seen corresponding path program 1 times [2025-02-06 03:13:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919785104] [2025-02-06 03:13:49,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:49,740 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:13:49,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:49,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:13:49,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:13:49,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:13:50,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:13:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:50,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:13:50,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:50,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:50,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919785104] [2025-02-06 03:13:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919785104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219862094] [2025-02-06 03:13:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:50,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:50,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:50,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:50,104 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:50,465 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2025-02-06 03:13:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:13:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:50,466 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:13:50,466 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:50,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:50,466 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:50,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:13:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:13:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-02-06 03:13:50,470 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 96 [2025-02-06 03:13:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:50,471 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-02-06 03:13:50,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-02-06 03:13:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:13:50,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:50,473 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:13:50,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:13:50,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:50,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1007770222, now seen corresponding path program 1 times [2025-02-06 03:13:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:50,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758946345] [2025-02-06 03:13:50,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:50,674 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:13:50,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:50,676 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:13:50,676 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:13:50,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:13:50,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:13:50,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:50,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:50,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:50,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:51,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:13:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:51,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:51,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758946345] [2025-02-06 03:13:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758946345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:51,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121134804] [2025-02-06 03:13:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:13:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:51,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:13:51,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:51,022 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:51,332 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2025-02-06 03:13:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:13:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:13:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:51,334 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:13:51,334 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:13:51,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:13:51,334 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:51,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:13:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:13:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:13:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2025-02-06 03:13:51,343 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 96 [2025-02-06 03:13:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:51,343 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2025-02-06 03:13:51,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2025-02-06 03:13:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:13:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:51,344 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,354 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 (10)] Ended with exit code 0 [2025-02-06 03:13:51,545 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:13:51,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1219121135, now seen corresponding path program 1 times [2025-02-06 03:13:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508162426] [2025-02-06 03:13:51,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:51,546 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:13:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:51,547 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:13:51,548 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:13:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:13:51,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:13:51,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:51,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:51,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:13:51,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:52,026 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 34 treesize of output 30 [2025-02-06 03:13:52,113 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 41 treesize of output 29 [2025-02-06 03:13:52,159 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 33 [2025-02-06 03:13:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:13:52,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:52,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508162426] [2025-02-06 03:13:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508162426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:52,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:52,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:13:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311098333] [2025-02-06 03:13:52,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:52,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:13:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:52,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:13:52,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:13:52,281 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:54,976 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2025-02-06 03:13:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:13:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:13:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:54,978 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:13:54,978 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 03:13:54,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:13:54,979 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 109 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:54,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1262 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 03:13:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 03:13:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2025-02-06 03:13:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 154 states have internal predecessors, (200), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:13:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 236 transitions. [2025-02-06 03:13:54,988 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 236 transitions. Word has length 96 [2025-02-06 03:13:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 236 transitions. [2025-02-06 03:13:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:13:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 236 transitions. [2025-02-06 03:13:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:13:54,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:54,989 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:13:55,189 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:13:55,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -577830224, now seen corresponding path program 1 times [2025-02-06 03:13:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431080831] [2025-02-06 03:13:55,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:55,190 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:13:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:55,192 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:13:55,194 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:13:55,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:13:56,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:13:56,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:56,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:56,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:13:56,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:56,472 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 34 treesize of output 30 [2025-02-06 03:13:56,522 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 16 treesize of output 8 [2025-02-06 03:13:57,297 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 84 treesize of output 60 [2025-02-06 03:13:57,987 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 110 treesize of output 56 [2025-02-06 03:13:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 03:13:59,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:14:13,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:13,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431080831] [2025-02-06 03:14:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431080831] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:13,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 25 [2025-02-06 03:14:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789718998] [2025-02-06 03:14:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:14:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:13,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:14:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:14:13,608 INFO L87 Difference]: Start difference. First operand 175 states and 236 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:12,755 INFO L93 Difference]: Finished difference Result 457 states and 610 transitions. [2025-02-06 03:15:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:15:12,764 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:15:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:12,766 INFO L225 Difference]: With dead ends: 457 [2025-02-06 03:15:12,766 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:15:12,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:15:12,768 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 297 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:12,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1407 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 43.6s Time] [2025-02-06 03:15:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:15:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2025-02-06 03:15:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3013100436681222) internal successors, (298), 231 states have internal predecessors, (298), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:15:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2025-02-06 03:15:12,787 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 96 [2025-02-06 03:15:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:12,787 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2025-02-06 03:15:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2025-02-06 03:15:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:15:12,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:12,789 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:12,799 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:12,989 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:12,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:12,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:12,990 INFO L85 PathProgramCache]: Analyzing trace with hash 655586410, now seen corresponding path program 1 times [2025-02-06 03:15:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:12,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109006367] [2025-02-06 03:15:12,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:12,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:12,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:12,992 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:12,993 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:13,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:15:13,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:15:13,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:13,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:13,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:13,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:15:13,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:13,323 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109006367] [2025-02-06 03:15:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109006367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010089943] [2025-02-06 03:15:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:13,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:13,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:13,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:13,325 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:13,632 INFO L93 Difference]: Finished difference Result 506 states and 684 transitions. [2025-02-06 03:15:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:13,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:15:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:13,636 INFO L225 Difference]: With dead ends: 506 [2025-02-06 03:15:13,636 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 03:15:13,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:13,637 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:13,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:15:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 03:15:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-02-06 03:15:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.296943231441048) internal successors, (297), 231 states have internal predecessors, (297), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:15:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2025-02-06 03:15:13,663 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 96 [2025-02-06 03:15:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:13,663 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2025-02-06 03:15:13,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2025-02-06 03:15:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:15:13,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:13,664 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:13,674 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:13,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:13,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:13,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 866937323, now seen corresponding path program 1 times [2025-02-06 03:15:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645019300] [2025-02-06 03:15:13,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:13,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:13,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:13,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:15:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:15:14,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:15:14,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:14,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:14,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:14,181 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 43 treesize of output 19 [2025-02-06 03:15:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:15:14,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:14,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645019300] [2025-02-06 03:15:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645019300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:14,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:14,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870514441] [2025-02-06 03:15:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:14,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:14,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:14,217 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:14,259 INFO L93 Difference]: Finished difference Result 500 states and 676 transitions. [2025-02-06 03:15:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:15:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:14,262 INFO L225 Difference]: With dead ends: 500 [2025-02-06 03:15:14,262 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:15:14,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:14,263 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:14,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:15:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-06 03:15:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 223 states have (on average 1.295964125560538) internal successors, (289), 225 states have internal predecessors, (289), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:15:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 347 transitions. [2025-02-06 03:15:14,278 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 347 transitions. Word has length 96 [2025-02-06 03:15:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 347 transitions. [2025-02-06 03:15:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 347 transitions. [2025-02-06 03:15:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:15:14,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:14,279 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 03:15:14,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:14,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1813245819, now seen corresponding path program 1 times [2025-02-06 03:15:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366106871] [2025-02-06 03:15:14,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:14,484 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:14,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:14,485 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:14,486 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:14,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:15:14,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:15:14,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:14,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:14,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:14,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:15:14,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:14,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366106871] [2025-02-06 03:15:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366106871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049625375] [2025-02-06 03:15:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:14,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:14,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:14,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:14,799 INFO L87 Difference]: Start difference. First operand 258 states and 347 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:14,834 INFO L93 Difference]: Finished difference Result 494 states and 666 transitions. [2025-02-06 03:15:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:14,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-02-06 03:15:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:14,836 INFO L225 Difference]: With dead ends: 494 [2025-02-06 03:15:14,836 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:15:14,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:14,836 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:14,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:15:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-06 03:15:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 223 states have (on average 1.2825112107623318) internal successors, (286), 225 states have internal predecessors, (286), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:15:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 344 transitions. [2025-02-06 03:15:14,851 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 344 transitions. Word has length 101 [2025-02-06 03:15:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:14,852 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 344 transitions. [2025-02-06 03:15:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 344 transitions. [2025-02-06 03:15:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:15:14,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:14,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,864 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 (15)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:15,054 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:15,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:15,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash 968773948, now seen corresponding path program 1 times [2025-02-06 03:15:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762965152] [2025-02-06 03:15:15,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:15,056 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:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:15,057 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:15,058 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:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:15:15,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:15:15,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:15,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:15,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:15,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:15,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:15:15,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:15,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:15,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762965152] [2025-02-06 03:15:15,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762965152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:15,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:15,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124682539] [2025-02-06 03:15:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:15,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:15,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:15,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:15,390 INFO L87 Difference]: Start difference. First operand 258 states and 344 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:15,425 INFO L93 Difference]: Finished difference Result 494 states and 660 transitions. [2025-02-06 03:15:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-02-06 03:15:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:15,428 INFO L225 Difference]: With dead ends: 494 [2025-02-06 03:15:15,428 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:15:15,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:15,435 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:15,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:15:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-06 03:15:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 223 states have (on average 1.2690582959641257) internal successors, (283), 225 states have internal predecessors, (283), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:15:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 341 transitions. [2025-02-06 03:15:15,449 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 341 transitions. Word has length 101 [2025-02-06 03:15:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:15,449 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 341 transitions. [2025-02-06 03:15:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 341 transitions. [2025-02-06 03:15:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:15:15,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:15,450 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:15:15,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:15,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:15,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1972883651, now seen corresponding path program 1 times [2025-02-06 03:15:15,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:15,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072971661] [2025-02-06 03:15:15,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:15,654 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:15,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:15,656 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:15,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:15:15,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:15:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:15:15,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:15,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:15,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:15,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:15:15,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:15,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072971661] [2025-02-06 03:15:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072971661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:15,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:15,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:15,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638272435] [2025-02-06 03:15:15,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:15,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:15,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:15,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:15,985 INFO L87 Difference]: Start difference. First operand 258 states and 341 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:16,023 INFO L93 Difference]: Finished difference Result 494 states and 654 transitions. [2025-02-06 03:15:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-02-06 03:15:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:16,024 INFO L225 Difference]: With dead ends: 494 [2025-02-06 03:15:16,024 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:15:16,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:16,025 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:16,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:15:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-06 03:15:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 223 states have (on average 1.2556053811659194) internal successors, (280), 225 states have internal predecessors, (280), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:15:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 338 transitions. [2025-02-06 03:15:16,035 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 338 transitions. Word has length 101 [2025-02-06 03:15:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:16,035 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 338 transitions. [2025-02-06 03:15:16,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:15:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 338 transitions. [2025-02-06 03:15:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:15:16,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:16,036 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-02-06 03:15:16,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:16,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -465331842, now seen corresponding path program 1 times [2025-02-06 03:15:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422995365] [2025-02-06 03:15:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:16,239 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:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:16,241 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:16,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-06 03:15:16,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:15:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:15:16,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:16,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:15:16,554 INFO L279 TraceCheckSpWp]: Computing forward predicates...