./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.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 4a633b68302485b97355fcc8c9ab86b75c4bb68dbf6f93417fd79b2d2487527c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:40:21,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:40:21,304 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:40:21,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:40:21,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:40:21,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:40:21,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:40:21,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:40:21,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:40:21,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:40:21,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:40:21,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:40:21,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:40:21,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:40:21,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:40:21,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:40:21,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:40:21,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:40:21,343 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 -> 4a633b68302485b97355fcc8c9ab86b75c4bb68dbf6f93417fd79b2d2487527c [2025-02-06 03:40:21,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:40:21,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:40:21,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:40:21,586 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:40:21,586 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:40:21,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i [2025-02-06 03:40:22,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/175fbddd0/d6e302a6a8ef477cafb965892d06c277/FLAGb23efb02c [2025-02-06 03:40:22,987 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:40:22,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i [2025-02-06 03:40:23,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/175fbddd0/d6e302a6a8ef477cafb965892d06c277/FLAGb23efb02c [2025-02-06 03:40:23,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/175fbddd0/d6e302a6a8ef477cafb965892d06c277 [2025-02-06 03:40:23,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:40:23,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:40:23,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:40:23,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:40:23,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:40:23,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23, skipping insertion in model container [2025-02-06 03:40:23,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:40:23,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i[916,929] [2025-02-06 03:40:23,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:40:23,198 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:40:23,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i[916,929] [2025-02-06 03:40:23,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:40:23,248 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:40:23,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23 WrapperNode [2025-02-06 03:40:23,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:40:23,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:40:23,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:40:23,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:40:23,253 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:40:23" (1/1) ... [2025-02-06 03:40:23,261 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:40:23" (1/1) ... [2025-02-06 03:40:23,285 INFO L138 Inliner]: procedures = 29, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-02-06 03:40:23,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:40:23,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:40:23,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:40:23,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:40:23,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,317 INFO L175 MemorySlicer]: Split 101 memory accesses to 12 slices as follows [2, 12, 8, 17, 8, 8, 3, 6, 6, 8, 17, 6]. 17 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 5, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1]. [2025-02-06 03:40:23,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:40:23,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:40:23,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:40:23,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:40:23,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (1/1) ... [2025-02-06 03:40:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:40:23,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:40:23,381 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:40:23,383 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:40:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:40:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:40:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:40:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:40:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:40:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:40:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:40:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:40:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:40:23,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:40:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:40:23,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:40:23,537 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:40:23,539 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:40:23,876 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem58#1;havoc property_#t~ite80#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~ite78#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~ite66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem71#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short70#1;havoc property_#t~mem73#1;havoc property_#t~ite77#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1; [2025-02-06 03:40:23,911 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-02-06 03:40:23,911 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:40:23,927 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:40:23,927 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:40:23,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:23 BoogieIcfgContainer [2025-02-06 03:40:23,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:40:23,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:40:23,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:40:23,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:40:23,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:40:23" (1/3) ... [2025-02-06 03:40:23,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dee951e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:40:23, skipping insertion in model container [2025-02-06 03:40:23,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:23" (2/3) ... [2025-02-06 03:40:23,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dee951e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:40:23, skipping insertion in model container [2025-02-06 03:40:23,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:23" (3/3) ... [2025-02-06 03:40:23,934 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-46.i [2025-02-06 03:40:23,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:40:23,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-46.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:40:23,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:40:23,988 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;@2dd15b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:40:23,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:40:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:40:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:23,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:23,998 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:23,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:24,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:24,002 INFO L85 PathProgramCache]: Analyzing trace with hash 986088222, now seen corresponding path program 1 times [2025-02-06 03:40:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:40:24,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-02-06 03:40:24,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:40:24,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:24,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:24,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:24,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:40:24,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:40:24,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-02-06 03:40:24,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128322151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:24,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609224533] [2025-02-06 03:40:24,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:40:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:40:24,303 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:40:24,306 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:40:24,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:24,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:24,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:24,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:24,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:40:24,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:40:24,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609224533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:24,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:40:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680408214] [2025-02-06 03:40:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:40:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:40:24,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:40:24,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:40:24,543 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:24,568 INFO L93 Difference]: Finished difference Result 194 states and 299 transitions. [2025-02-06 03:40:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:40:24,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-02-06 03:40:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:24,575 INFO L225 Difference]: With dead ends: 194 [2025-02-06 03:40:24,575 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 03:40:24,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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:40:24,579 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:24,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:40:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 03:40:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 03:40:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:40:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-02-06 03:40:24,604 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 116 [2025-02-06 03:40:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:24,604 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-02-06 03:40:24,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-02-06 03:40:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:24,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:24,607 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:24,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:24,808 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:40:24,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:24,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1271840112, now seen corresponding path program 1 times [2025-02-06 03:40:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:40:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188791365] [2025-02-06 03:40:24,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:40:24,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:24,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:24,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:24,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:40:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188791365] [2025-02-06 03:40:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188791365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:40:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675668972] [2025-02-06 03:40:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:25,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:40:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:40:25,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:40:25,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:40:25,880 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:26,305 INFO L93 Difference]: Finished difference Result 348 states and 504 transitions. [2025-02-06 03:40:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-02-06 03:40:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:26,308 INFO L225 Difference]: With dead ends: 348 [2025-02-06 03:40:26,309 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 03:40:26,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:40:26,310 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 381 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:26,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 780 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:40:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 03:40:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 249. [2025-02-06 03:40:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.412037037037037) internal successors, (305), 217 states have internal predecessors, (305), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:40:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 363 transitions. [2025-02-06 03:40:26,345 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 363 transitions. Word has length 116 [2025-02-06 03:40:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:26,345 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 363 transitions. [2025-02-06 03:40:26,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 363 transitions. [2025-02-06 03:40:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:26,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:26,347 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:26,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:40:26,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1565243119, now seen corresponding path program 1 times [2025-02-06 03:40:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:40:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722053403] [2025-02-06 03:40:26,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:40:26,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:26,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:26,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:40:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722053403] [2025-02-06 03:40:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722053403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639678821] [2025-02-06 03:40:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:26,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:40:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:26,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:26,719 INFO L87 Difference]: Start difference. First operand 249 states and 363 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:26,816 INFO L93 Difference]: Finished difference Result 747 states and 1092 transitions. [2025-02-06 03:40:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:26,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:26,822 INFO L225 Difference]: With dead ends: 747 [2025-02-06 03:40:26,823 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 03:40:26,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:40:26,825 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 129 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:26,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 564 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 03:40:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 285. [2025-02-06 03:40:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 252 states have (on average 1.4087301587301588) internal successors, (355), 253 states have internal predecessors, (355), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:40:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 413 transitions. [2025-02-06 03:40:26,852 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 413 transitions. Word has length 116 [2025-02-06 03:40:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:26,852 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 413 transitions. [2025-02-06 03:40:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 413 transitions. [2025-02-06 03:40:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:26,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:26,854 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:26,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:40:26,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:26,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2104294325, now seen corresponding path program 1 times [2025-02-06 03:40:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:40:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-02-06 03:40:26,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:40:26,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:26,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:26,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:26,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:40:26,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085287944] [2025-02-06 03:40:26,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:26,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:40:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:40:26,952 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:40:26,954 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:40:27,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:27,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:27,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:27,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:40:27,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:40:27,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:27,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:27,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:27,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:40:27,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:40:27,547 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:40:27,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:40:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:40:27,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:40:27,752 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:40:27,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:40:27,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:40:27 BoogieIcfgContainer [2025-02-06 03:40:27,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:40:27,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:40:27,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:40:27,893 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:40:27,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:23" (3/4) ... [2025-02-06 03:40:27,896 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:40:27,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:40:27,898 INFO L158 Benchmark]: Toolchain (without parser) took 4862.87ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.4MB in the beginning and 131.2MB in the end (delta: -18.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-02-06 03:40:27,899 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:40:27,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.07ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.4MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:40:27,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.61ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:40:27,901 INFO L158 Benchmark]: Boogie Preprocessor took 64.13ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 92.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:40:27,901 INFO L158 Benchmark]: IcfgBuilder took 576.34ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 57.0MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:40:27,901 INFO L158 Benchmark]: TraceAbstraction took 3962.66ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 131.2MB in the end (delta: -75.0MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2025-02-06 03:40:27,901 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 131.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:40:27,903 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.07ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.4MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.61ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.13ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 92.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 576.34ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 57.0MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3962.66ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 131.2MB in the end (delta: -75.0MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 131.2MB in the end (delta: 30.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 someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L22] unsigned char var_1_1 = 1; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] double var_1_2 = 31.75; [L24] double var_1_2 = 31.75; [L25] double* var_1_2_Pointer = &(var_1_2); [L26] signed char var_1_4 = -8; [L26] signed char var_1_4 = -8; [L27] signed char* var_1_4_Pointer = &(var_1_4); [L28] unsigned char var_1_6 = 0; [L28] unsigned char var_1_6 = 0; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 0; [L30] unsigned char var_1_7 = 0; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 1; [L32] unsigned char var_1_8 = 1; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 1; [L34] unsigned char var_1_9 = 1; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] signed short int var_1_10 = -4; [L36] signed short int var_1_10 = -4; [L37] signed short int* var_1_10_Pointer = &(var_1_10); [L38] signed short int var_1_12 = 32; [L38] signed short int var_1_12 = 32; [L39] signed short int* var_1_12_Pointer = &(var_1_12); [L40] signed char var_1_13 = -25; [L40] signed char var_1_13 = -25; [L41] signed char* var_1_13_Pointer = &(var_1_13); [L42] signed char var_1_16 = 4; [L42] signed char var_1_16 = 4; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] unsigned char last_1_var_1_1 = 1; [L45] signed short int last_1_var_1_10 = -4; VAL [isInitial=0, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] EXPR \read(var_1_1) [L107] last_1_var_1_1 = var_1_1 [L108] EXPR \read(var_1_10) [L108] last_1_var_1_10 = var_1_10 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_double() [L85] EXPR \read(var_1_2) [L85] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L85] EXPR \read(var_1_2) [L85] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_4 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_6 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_12 = __VERIFIER_nondet_short() [L100] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] var_1_16 = __VERIFIER_nondet_char() [L103] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L119] RET updateVariables() [L120] CALL step() [L49] EXPR \read(*var_1_12_Pointer) [L49] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L49] COND FALSE !(last_1_var_1_10 <= ((*(var_1_12_Pointer)) / (*(var_1_4_Pointer)))) [L54] EXPR \read(*var_1_4_Pointer) [L54] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))) [L54] EXPR \read(*var_1_4_Pointer) [L54] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] signed long int stepLocal_1 = ((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer)))); [L55] EXPR \read(*var_1_13_Pointer) [L55] EXPR \read(*var_1_4_Pointer) [L55] signed long int stepLocal_0 = (*(var_1_13_Pointer)) / (*(var_1_4_Pointer)); [L56] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND TRUE (- (*(var_1_2_Pointer))) >= 16.75 [L57] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] COND TRUE stepLocal_0 >= (*(var_1_13_Pointer)) [L58] COND TRUE stepLocal_1 > -32 [L59] (*(var_1_1_Pointer)) = 0 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L73] EXPR \read(*var_1_13_Pointer) [L73] signed char stepLocal_2 = (*(var_1_13_Pointer)); [L74] EXPR \read(*var_1_13_Pointer) [L74] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] EXPR (*(var_1_13_Pointer)) | (*(var_1_13_Pointer)) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_2=-25, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND TRUE (((*(var_1_13_Pointer)) | (*(var_1_13_Pointer))) + (*(var_1_4_Pointer))) < stepLocal_2 [L75] EXPR \read(*var_1_12_Pointer) [L75] (*(var_1_10_Pointer)) = ((*(var_1_12_Pointer)) - 256) [L79] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] COND FALSE !(1 == (*(var_1_4_Pointer))) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR ((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1)) [L111] EXPR \read(*var_1_1_Pointer) [L111] EXPR ((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1)) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR (((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR (((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR ((((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1)) && (((((*(var_1_13_Pointer)) | (*(var_1_13_Pointer))) + (*(var_1_4_Pointer))) < (*(var_1_13_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) - 256))) : ((*(var_1_10_Pointer)) == ((signed short int) 128))) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR ((((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1)) && (((((*(var_1_13_Pointer)) | (*(var_1_13_Pointer))) + (*(var_1_4_Pointer))) < (*(var_1_13_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) - 256))) : ((*(var_1_10_Pointer)) == ((signed short int) 128))) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR (((((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1)) && (((((*(var_1_13_Pointer)) | (*(var_1_13_Pointer))) + (*(var_1_4_Pointer))) < (*(var_1_13_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) - 256))) : ((*(var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_var_1_10 <= ((*(var_1_12_Pointer)) / (*(var_1_4_Pointer)))) ? (last_1_var_1_1 ? ((*(var_1_13_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR (((((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1)) && (((((*(var_1_13_Pointer)) | (*(var_1_13_Pointer))) + (*(var_1_4_Pointer))) < (*(var_1_13_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) - 256))) : ((*(var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_var_1_10 <= ((*(var_1_12_Pointer)) / (*(var_1_4_Pointer)))) ? (last_1_var_1_1 ? ((*(var_1_13_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111-L112] return (((((- (*(var_1_2_Pointer))) >= 16.75) ? ((((*(var_1_13_Pointer)) / (*(var_1_4_Pointer))) >= (*(var_1_13_Pointer))) ? (((((((*(var_1_4_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_13_Pointer))))) > -32) ? ((*(var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_6_Pointer)) || (*(var_1_7_Pointer)))))) : ((*(var_1_6_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))))) : ((*(var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(var_1_4_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) : 1)) && (((((*(var_1_13_Pointer)) | (*(var_1_13_Pointer))) + (*(var_1_4_Pointer))) < (*(var_1_13_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) - 256))) : ((*(var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_var_1_10 <= ((*(var_1_12_Pointer)) / (*(var_1_4_Pointer)))) ? (last_1_var_1_1 ? ((*(var_1_13_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) : 1) : 1) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 510 mSDsluCounter, 1482 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 405 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 221 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1430/1456 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:40:27,920 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-p_file-46.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 4a633b68302485b97355fcc8c9ab86b75c4bb68dbf6f93417fd79b2d2487527c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:40:29,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:40:29,808 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:40:29,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:40:29,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:40:29,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:40:29,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:40:29,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:40:29,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:40:29,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:40:29,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:40:29,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:40:29,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:40:29,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:40:29,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:40:29,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:40:29,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:40:29,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:40:29,862 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 -> 4a633b68302485b97355fcc8c9ab86b75c4bb68dbf6f93417fd79b2d2487527c [2025-02-06 03:40:30,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:40:30,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:40:30,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:40:30,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:40:30,078 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:40:30,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i [2025-02-06 03:40:31,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b429b9c1/cd036810258f4620a11d602da2de339a/FLAGb767d021a [2025-02-06 03:40:31,527 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:40:31,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i [2025-02-06 03:40:31,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b429b9c1/cd036810258f4620a11d602da2de339a/FLAGb767d021a [2025-02-06 03:40:31,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b429b9c1/cd036810258f4620a11d602da2de339a [2025-02-06 03:40:31,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:40:31,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:40:31,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:40:31,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:40:31,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:40:31,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:40:31" (1/1) ... [2025-02-06 03:40:31,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1204426b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:31, skipping insertion in model container [2025-02-06 03:40:31,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:40:31" (1/1) ... [2025-02-06 03:40:31,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:40:31,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i[916,929] [2025-02-06 03:40:32,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:40:32,045 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:40:32,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i[916,929] [2025-02-06 03:40:32,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:40:32,106 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:40:32,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32 WrapperNode [2025-02-06 03:40:32,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:40:32,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:40:32,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:40:32,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:40:32,112 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:40:32" (1/1) ... [2025-02-06 03:40:32,119 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:40:32" (1/1) ... [2025-02-06 03:40:32,140 INFO L138 Inliner]: procedures = 33, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2025-02-06 03:40:32,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:40:32,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:40:32,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:40:32,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:40:32,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,177 INFO L175 MemorySlicer]: Split 101 memory accesses to 12 slices as follows [2, 12, 8, 17, 8, 8, 3, 6, 6, 8, 17, 6]. 17 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 5, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1]. [2025-02-06 03:40:32,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:40:32,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:40:32,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:40:32,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:40:32,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (1/1) ... [2025-02-06 03:40:32,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:40:32,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:40:32,230 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:40:32,232 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:40:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-02-06 03:40:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:40:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:40:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:40:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-02-06 03:40:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:40:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:40:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:40:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:40:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:40:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:40:32,428 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:40:32,430 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:40:32,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem57#1;havoc property_#t~ite79#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite77#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~short69#1;havoc property_#t~mem72#1;havoc property_#t~ite76#1;havoc property_#t~mem73#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short100#1; [2025-02-06 03:40:32,945 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-06 03:40:32,946 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:40:32,954 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:40:32,954 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:40:32,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:32 BoogieIcfgContainer [2025-02-06 03:40:32,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:40:32,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:40:32,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:40:32,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:40:32,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:40:31" (1/3) ... [2025-02-06 03:40:32,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397b54f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:40:32, skipping insertion in model container [2025-02-06 03:40:32,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:32" (2/3) ... [2025-02-06 03:40:32,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397b54f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:40:32, skipping insertion in model container [2025-02-06 03:40:32,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:32" (3/3) ... [2025-02-06 03:40:32,962 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-46.i [2025-02-06 03:40:32,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:40:32,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-46.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:40:33,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:40:33,019 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;@53905b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:40:33,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:40:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 75 states have (on average 1.4) internal successors, (105), 76 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:40:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:40:33,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:33,029 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:33,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:33,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 647389320, now seen corresponding path program 1 times [2025-02-06 03:40:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334406024] [2025-02-06 03:40:33,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:33,044 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:40:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:33,050 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:40:33,051 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:40:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:40:33,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:40:33,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:33,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:33,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:40:33,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-06 03:40:33,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:33,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334406024] [2025-02-06 03:40:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334406024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:40:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330566213] [2025-02-06 03:40:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:40:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:33,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:40:33,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:40:33,392 INFO L87 Difference]: Start difference. First operand has 92 states, 75 states have (on average 1.4) internal successors, (105), 76 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:33,415 INFO L93 Difference]: Finished difference Result 178 states and 275 transitions. [2025-02-06 03:40:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:40:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 03:40:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:33,422 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:40:33,423 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:40:33,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:40:33,428 INFO L435 NwaCegarLoop]: 128 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, 128 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:40:33,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:40:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:40:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:40:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:40:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2025-02-06 03:40:33,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2025-02-06 03:40:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:33,467 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2025-02-06 03:40:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2025-02-06 03:40:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:40:33,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:33,472 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:33,480 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 (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:33,673 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:40:33,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash 640570490, now seen corresponding path program 1 times [2025-02-06 03:40:33,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483890093] [2025-02-06 03:40:33,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:33,678 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:40:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:33,686 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:40:33,714 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:40:33,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:40:33,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:40:33,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:33,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:40:33,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:34,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:40:34,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 03:40:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:34,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:34,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483890093] [2025-02-06 03:40:34,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483890093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:34,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:34,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188940572] [2025-02-06 03:40:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:34,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:34,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:34,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:40:34,282 INFO L87 Difference]: Start difference. First operand 89 states and 128 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:34,561 INFO L93 Difference]: Finished difference Result 316 states and 456 transitions. [2025-02-06 03:40:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:34,561 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 03:40:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:34,564 INFO L225 Difference]: With dead ends: 316 [2025-02-06 03:40:34,565 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:40:34,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:34,566 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 203 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:34,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 588 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:40:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:40:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2025-02-06 03:40:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 192 states have (on average 1.4010416666666667) internal successors, (269), 193 states have internal predecessors, (269), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:40:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2025-02-06 03:40:34,586 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 114 [2025-02-06 03:40:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:34,587 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2025-02-06 03:40:34,587 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2025-02-06 03:40:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:40:34,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:34,589 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:34,597 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:40:34,794 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:40:34,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:34,795 INFO L85 PathProgramCache]: Analyzing trace with hash 347167483, now seen corresponding path program 1 times [2025-02-06 03:40:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151727495] [2025-02-06 03:40:34,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:34,795 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:40:34,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:34,797 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:40:34,798 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:40:34,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:40:35,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:40:35,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:35,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:40:35,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:35,038 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 12 treesize of output 8 [2025-02-06 03:40:35,075 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 37 treesize of output 25 [2025-02-06 03:40:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:35,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:35,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151727495] [2025-02-06 03:40:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151727495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:35,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161380646] [2025-02-06 03:40:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:35,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:35,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:35,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:35,093 INFO L87 Difference]: Start difference. First operand 225 states and 327 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:35,196 INFO L93 Difference]: Finished difference Result 675 states and 984 transitions. [2025-02-06 03:40:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:35,196 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 03:40:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:35,200 INFO L225 Difference]: With dead ends: 675 [2025-02-06 03:40:35,200 INFO L226 Difference]: Without dead ends: 453 [2025-02-06 03:40:35,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:40:35,201 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 119 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:35,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 509 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-06 03:40:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 249. [2025-02-06 03:40:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 217 states have internal predecessors, (301), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:40:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 359 transitions. [2025-02-06 03:40:35,222 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 359 transitions. Word has length 114 [2025-02-06 03:40:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:35,223 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 359 transitions. [2025-02-06 03:40:35,223 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 359 transitions. [2025-02-06 03:40:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:35,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:35,226 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:35,239 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 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:35,427 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:40:35,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1928828427, now seen corresponding path program 1 times [2025-02-06 03:40:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962599592] [2025-02-06 03:40:35,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:35,429 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:40:35,430 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:40:35,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:35,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:35,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:35,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:35,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:40:35,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:36,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:36,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 34 [2025-02-06 03:40:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:36,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:36,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962599592] [2025-02-06 03:40:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962599592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:36,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:36,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:40:36,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657629369] [2025-02-06 03:40:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:36,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:40:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:36,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:40:36,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:36,737 INFO L87 Difference]: Start difference. First operand 249 states and 359 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:37,593 INFO L93 Difference]: Finished difference Result 839 states and 1209 transitions. [2025-02-06 03:40:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:40:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:37,598 INFO L225 Difference]: With dead ends: 839 [2025-02-06 03:40:37,598 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 03:40:37,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:40:37,599 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 330 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:37,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 852 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:40:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 03:40:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 373. [2025-02-06 03:40:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 308 states have (on average 1.37012987012987) internal successors, (422), 310 states have internal predecessors, (422), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:40:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 538 transitions. [2025-02-06 03:40:37,639 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 538 transitions. Word has length 116 [2025-02-06 03:40:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:37,639 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 538 transitions. [2025-02-06 03:40:37,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 538 transitions. [2025-02-06 03:40:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:37,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:37,641 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:37,841 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:40:37,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:37,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -425527015, now seen corresponding path program 1 times [2025-02-06 03:40:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227586190] [2025-02-06 03:40:37,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:37,843 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:40:37,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:37,846 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:40:37,846 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:40:37,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:38,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:38,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:38,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:38,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:40:38,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:38,123 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 19 treesize of output 11 [2025-02-06 03:40:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:40:38,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:38,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227586190] [2025-02-06 03:40:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227586190] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:38,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:38,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-06 03:40:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725223130] [2025-02-06 03:40:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:38,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:38,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:38,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:38,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:40:38,371 INFO L87 Difference]: Start difference. First operand 373 states and 538 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:38,471 INFO L93 Difference]: Finished difference Result 857 states and 1224 transitions. [2025-02-06 03:40:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:38,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:38,474 INFO L225 Difference]: With dead ends: 857 [2025-02-06 03:40:38,474 INFO L226 Difference]: Without dead ends: 487 [2025-02-06 03:40:38,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:38,475 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:38,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 447 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-06 03:40:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 427. [2025-02-06 03:40:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 358 states have (on average 1.3659217877094971) internal successors, (489), 362 states have internal predecessors, (489), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:40:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 609 transitions. [2025-02-06 03:40:38,495 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 609 transitions. Word has length 116 [2025-02-06 03:40:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:38,495 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 609 transitions. [2025-02-06 03:40:38,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 609 transitions. [2025-02-06 03:40:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:38,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:38,497 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,504 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:40:38,697 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:40:38,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:38,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -622040520, now seen corresponding path program 1 times [2025-02-06 03:40:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845994114] [2025-02-06 03:40:38,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:38,698 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:40:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:38,701 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:40:38,702 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:40:38,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:38,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:38,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:38,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:40:38,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:38,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:38,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:38,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845994114] [2025-02-06 03:40:38,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845994114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926065024] [2025-02-06 03:40:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:38,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:38,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:38,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:38,907 INFO L87 Difference]: Start difference. First operand 427 states and 609 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:38,938 INFO L93 Difference]: Finished difference Result 861 states and 1229 transitions. [2025-02-06 03:40:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:38,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:38,940 INFO L225 Difference]: With dead ends: 861 [2025-02-06 03:40:38,940 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 03:40:38,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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:40:38,941 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:38,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:40:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 03:40:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-02-06 03:40:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 368 states have (on average 1.3559782608695652) internal successors, (499), 372 states have internal predecessors, (499), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:40:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 619 transitions. [2025-02-06 03:40:38,965 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 619 transitions. Word has length 116 [2025-02-06 03:40:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:38,965 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 619 transitions. [2025-02-06 03:40:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 619 transitions. [2025-02-06 03:40:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:38,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:38,967 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,974 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:40:39,167 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:40:39,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:39,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1721727911, now seen corresponding path program 1 times [2025-02-06 03:40:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:39,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442947414] [2025-02-06 03:40:39,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:39,169 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:40:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:39,170 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:40:39,171 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:40:39,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:39,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:40:39,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:39,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:40:39,543 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 31 treesize of output 23 [2025-02-06 03:40:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:39,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:39,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442947414] [2025-02-06 03:40:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442947414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:39,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325830112] [2025-02-06 03:40:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:39,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:39,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:39,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:40:39,566 INFO L87 Difference]: Start difference. First operand 437 states and 619 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:39,805 INFO L93 Difference]: Finished difference Result 945 states and 1328 transitions. [2025-02-06 03:40:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:39,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:39,808 INFO L225 Difference]: With dead ends: 945 [2025-02-06 03:40:39,808 INFO L226 Difference]: Without dead ends: 511 [2025-02-06 03:40:39,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:39,809 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 162 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:39,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 579 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:40:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-06 03:40:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 437. [2025-02-06 03:40:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 368 states have (on average 1.3559782608695652) internal successors, (499), 372 states have internal predecessors, (499), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:40:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 619 transitions. [2025-02-06 03:40:39,834 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 619 transitions. Word has length 116 [2025-02-06 03:40:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:39,834 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 619 transitions. [2025-02-06 03:40:39,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 619 transitions. [2025-02-06 03:40:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:39,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:39,836 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:39,843 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:40:40,036 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:40:40,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:40,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash -368418214, now seen corresponding path program 1 times [2025-02-06 03:40:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415545343] [2025-02-06 03:40:40,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:40,037 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:40:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:40,039 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:40:40,040 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:40:40,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:40,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:40,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:40,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:40:40,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:40,665 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 17 treesize of output 13 [2025-02-06 03:40:40,717 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 72 treesize of output 52 [2025-02-06 03:40:40,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-02-06 03:40:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 28 proven. 192 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:40:40,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:40,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415545343] [2025-02-06 03:40:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415545343] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-02-06 03:40:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109868390] [2025-02-06 03:40:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:40,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:40:40,856 INFO L87 Difference]: Start difference. First operand 437 states and 619 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:40,967 INFO L93 Difference]: Finished difference Result 972 states and 1365 transitions. [2025-02-06 03:40:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:40:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:40,970 INFO L225 Difference]: With dead ends: 972 [2025-02-06 03:40:40,970 INFO L226 Difference]: Without dead ends: 538 [2025-02-06 03:40:40,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:40:40,972 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 80 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:40,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 738 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-06 03:40:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 526. [2025-02-06 03:40:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 421 states have (on average 1.3206650831353919) internal successors, (556), 427 states have internal predecessors, (556), 90 states have call successors, (90), 14 states have call predecessors, (90), 14 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 03:40:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 736 transitions. [2025-02-06 03:40:41,004 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 736 transitions. Word has length 116 [2025-02-06 03:40:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:41,004 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 736 transitions. [2025-02-06 03:40:41,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 736 transitions. [2025-02-06 03:40:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:40:41,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:41,007 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:41,015 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 (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:41,207 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:40:41,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1542457398, now seen corresponding path program 1 times [2025-02-06 03:40:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327822833] [2025-02-06 03:40:41,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:41,208 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:40:41,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:41,211 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:40:41,212 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:40:41,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:40:41,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:40:41,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:41,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:41,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:40:41,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:41,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:41,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327822833] [2025-02-06 03:40:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327822833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:40:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986084972] [2025-02-06 03:40:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:41,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:40:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:41,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:40:41,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:40:41,406 INFO L87 Difference]: Start difference. First operand 526 states and 736 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:41,449 INFO L93 Difference]: Finished difference Result 1035 states and 1451 transitions. [2025-02-06 03:40:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:40:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:40:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:41,453 INFO L225 Difference]: With dead ends: 1035 [2025-02-06 03:40:41,453 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 03:40:41,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 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:40:41,454 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:41,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:40:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 03:40:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-06 03:40:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 421 states have (on average 1.3087885985748218) internal successors, (551), 427 states have internal predecessors, (551), 90 states have call successors, (90), 14 states have call predecessors, (90), 14 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 03:40:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 731 transitions. [2025-02-06 03:40:41,480 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 731 transitions. Word has length 116 [2025-02-06 03:40:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:41,482 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 731 transitions. [2025-02-06 03:40:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 731 transitions. [2025-02-06 03:40:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:41,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:41,483 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:41,491 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:40:41,688 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:40:41,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1982986253, now seen corresponding path program 1 times [2025-02-06 03:40:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360001527] [2025-02-06 03:40:41,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:41,689 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:40:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:41,690 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:40:41,691 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:40:41,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:41,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:40:41,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:42,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:42,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 54 [2025-02-06 03:40:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:40:43,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:43,574 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-02-06 03:40:43,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 93 [2025-02-06 03:40:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:40:49,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360001527] [2025-02-06 03:40:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360001527] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:40:49,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:40:49,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-06 03:40:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320981829] [2025-02-06 03:40:49,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:40:49,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:40:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:49,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:40:49,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2025-02-06 03:40:49,518 INFO L87 Difference]: Start difference. First operand 526 states and 731 transitions. Second operand has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:40:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:51,252 INFO L93 Difference]: Finished difference Result 1463 states and 2010 transitions. [2025-02-06 03:40:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:40:51,253 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 118 [2025-02-06 03:40:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:51,257 INFO L225 Difference]: With dead ends: 1463 [2025-02-06 03:40:51,257 INFO L226 Difference]: Without dead ends: 959 [2025-02-06 03:40:51,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=281, Invalid=908, Unknown=1, NotChecked=0, Total=1190 [2025-02-06 03:40:51,259 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 766 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:51,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1203 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:40:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-06 03:40:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 539. [2025-02-06 03:40:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 414 states have (on average 1.2560386473429952) internal successors, (520), 422 states have internal predecessors, (520), 106 states have call successors, (106), 18 states have call predecessors, (106), 18 states have return successors, (106), 98 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-06 03:40:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 732 transitions. [2025-02-06 03:40:51,296 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 732 transitions. Word has length 118 [2025-02-06 03:40:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 732 transitions. [2025-02-06 03:40:51,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:40:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 732 transitions. [2025-02-06 03:40:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:51,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:51,298 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,307 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:40:51,499 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:40:51,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1242131570, now seen corresponding path program 1 times [2025-02-06 03:40:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470943288] [2025-02-06 03:40:51,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:51,500 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:40:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:51,502 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:40:51,502 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:40:51,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:51,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:51,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:51,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:51,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:40:51,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:51,901 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 18 treesize of output 10 [2025-02-06 03:40:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 8 proven. 204 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:40:51,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:52,057 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:40:52,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:40:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:40:52,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470943288] [2025-02-06 03:40:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470943288] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:40:52,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:40:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-02-06 03:40:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449777978] [2025-02-06 03:40:52,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:40:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:40:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:40:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:40:52,135 INFO L87 Difference]: Start difference. First operand 539 states and 732 transitions. Second operand has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:40:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:52,506 INFO L93 Difference]: Finished difference Result 1136 states and 1509 transitions. [2025-02-06 03:40:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:40:52,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 118 [2025-02-06 03:40:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:52,511 INFO L225 Difference]: With dead ends: 1136 [2025-02-06 03:40:52,512 INFO L226 Difference]: Without dead ends: 619 [2025-02-06 03:40:52,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:40:52,514 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 302 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:52,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 474 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:40:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-02-06 03:40:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 579. [2025-02-06 03:40:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 444 states have (on average 1.2297297297297298) internal successors, (546), 452 states have internal predecessors, (546), 106 states have call successors, (106), 28 states have call predecessors, (106), 28 states have return successors, (106), 98 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-06 03:40:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 758 transitions. [2025-02-06 03:40:52,569 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 758 transitions. Word has length 118 [2025-02-06 03:40:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:52,570 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 758 transitions. [2025-02-06 03:40:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:40:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 758 transitions. [2025-02-06 03:40:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:52,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:52,571 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:52,582 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:40:52,771 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:40:52,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:52,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1535534577, now seen corresponding path program 1 times [2025-02-06 03:40:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822577196] [2025-02-06 03:40:52,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:52,772 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:40:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:52,774 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:40:52,776 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:40:52,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:52,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:52,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:52,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:52,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:40:52,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:53,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:53,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 55 [2025-02-06 03:40:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:53,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:53,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:53,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822577196] [2025-02-06 03:40:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822577196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:53,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:40:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674700171] [2025-02-06 03:40:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:40:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:53,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:40:53,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:53,784 INFO L87 Difference]: Start difference. First operand 579 states and 758 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:54,656 INFO L93 Difference]: Finished difference Result 1364 states and 1794 transitions. [2025-02-06 03:40:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:40:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:54,660 INFO L225 Difference]: With dead ends: 1364 [2025-02-06 03:40:54,660 INFO L226 Difference]: Without dead ends: 807 [2025-02-06 03:40:54,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:40:54,662 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 326 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:54,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 618 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:40:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-06 03:40:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 599. [2025-02-06 03:40:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 464 states have (on average 1.230603448275862) internal successors, (571), 472 states have internal predecessors, (571), 106 states have call successors, (106), 28 states have call predecessors, (106), 28 states have return successors, (106), 98 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-06 03:40:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 783 transitions. [2025-02-06 03:40:54,713 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 783 transitions. Word has length 118 [2025-02-06 03:40:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:54,713 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 783 transitions. [2025-02-06 03:40:54,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 783 transitions. [2025-02-06 03:40:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:54,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:54,715 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:54,724 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:40:54,915 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:40:54,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2034364394, now seen corresponding path program 1 times [2025-02-06 03:40:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044756276] [2025-02-06 03:40:54,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:54,917 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:40:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:54,919 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:40:54,921 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:40:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:55,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:55,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:55,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:55,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:40:55,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:55,424 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 21 treesize of output 17 [2025-02-06 03:40:55,484 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 66 treesize of output 54 [2025-02-06 03:40:55,490 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 70 treesize of output 50 [2025-02-06 03:40:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 169 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-06 03:40:55,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:55,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044756276] [2025-02-06 03:40:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044756276] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-02-06 03:40:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998860918] [2025-02-06 03:40:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:55,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:55,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:40:55,635 INFO L87 Difference]: Start difference. First operand 599 states and 783 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:55,794 INFO L93 Difference]: Finished difference Result 1539 states and 2000 transitions. [2025-02-06 03:40:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:55,798 INFO L225 Difference]: With dead ends: 1539 [2025-02-06 03:40:55,798 INFO L226 Difference]: Without dead ends: 962 [2025-02-06 03:40:55,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:40:55,800 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 81 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:55,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 763 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-02-06 03:40:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 956. [2025-02-06 03:40:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 738 states have (on average 1.2113821138211383) internal successors, (894), 753 states have internal predecessors, (894), 170 states have call successors, (170), 47 states have call predecessors, (170), 47 states have return successors, (170), 155 states have call predecessors, (170), 170 states have call successors, (170) [2025-02-06 03:40:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1234 transitions. [2025-02-06 03:40:55,877 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1234 transitions. Word has length 118 [2025-02-06 03:40:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:55,879 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1234 transitions. [2025-02-06 03:40:55,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1234 transitions. [2025-02-06 03:40:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:55,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:55,880 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:55,888 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:40:56,080 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:40:56,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash -291554059, now seen corresponding path program 1 times [2025-02-06 03:40:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900999849] [2025-02-06 03:40:56,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:56,082 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:40:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:56,083 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:40:56,085 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:40:56,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:56,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:56,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:56,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:40:56,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:56,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2025-02-06 03:40:56,557 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 60 treesize of output 32 [2025-02-06 03:40:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:40:56,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:56,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900999849] [2025-02-06 03:40:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900999849] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:56,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:56,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-02-06 03:40:56,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660558123] [2025-02-06 03:40:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:56,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:40:56,695 INFO L87 Difference]: Start difference. First operand 956 states and 1234 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:56,880 INFO L93 Difference]: Finished difference Result 1906 states and 2456 transitions. [2025-02-06 03:40:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:56,885 INFO L225 Difference]: With dead ends: 1906 [2025-02-06 03:40:56,885 INFO L226 Difference]: Without dead ends: 972 [2025-02-06 03:40:56,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:40:56,887 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 104 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:56,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 341 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-02-06 03:40:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 933. [2025-02-06 03:40:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 724 states have (on average 1.2113259668508287) internal successors, (877), 738 states have internal predecessors, (877), 162 states have call successors, (162), 46 states have call predecessors, (162), 46 states have return successors, (162), 148 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-06 03:40:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1201 transitions. [2025-02-06 03:40:56,954 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1201 transitions. Word has length 118 [2025-02-06 03:40:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1201 transitions. [2025-02-06 03:40:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1201 transitions. [2025-02-06 03:40:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:56,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:56,956 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:56,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:40:57,156 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:40:57,156 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1416131031, now seen corresponding path program 1 times [2025-02-06 03:40:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:57,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804777470] [2025-02-06 03:40:57,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:57,157 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:40:57,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:57,159 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:40:57,160 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:40:57,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:57,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:57,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:57,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:57,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:40:57,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:57,523 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 24 treesize of output 16 [2025-02-06 03:40:57,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2025-02-06 03:40:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:57,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:57,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:57,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804777470] [2025-02-06 03:40:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804777470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309457214] [2025-02-06 03:40:57,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:57,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:57,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:40:57,546 INFO L87 Difference]: Start difference. First operand 933 states and 1201 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:57,882 INFO L93 Difference]: Finished difference Result 1908 states and 2453 transitions. [2025-02-06 03:40:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:57,887 INFO L225 Difference]: With dead ends: 1908 [2025-02-06 03:40:57,887 INFO L226 Difference]: Without dead ends: 997 [2025-02-06 03:40:57,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:40:57,888 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 187 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:57,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 548 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:40:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-02-06 03:40:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 927. [2025-02-06 03:40:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 718 states have (on average 1.2089136490250696) internal successors, (868), 732 states have internal predecessors, (868), 162 states have call successors, (162), 46 states have call predecessors, (162), 46 states have return successors, (162), 148 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-06 03:40:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1192 transitions. [2025-02-06 03:40:57,947 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1192 transitions. Word has length 118 [2025-02-06 03:40:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:57,947 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1192 transitions. [2025-02-06 03:40:57,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1192 transitions. [2025-02-06 03:40:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:57,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:57,949 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:57,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:40:58,153 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:40:58,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:58,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1178503096, now seen corresponding path program 1 times [2025-02-06 03:40:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:58,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747561330] [2025-02-06 03:40:58,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:58,154 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:40:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:58,156 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:40:58,157 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:40:58,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:58,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:58,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:58,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:58,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:40:58,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:58,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:40:58,532 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 18 treesize of output 10 [2025-02-06 03:40:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:58,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:58,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747561330] [2025-02-06 03:40:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747561330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:58,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839889109] [2025-02-06 03:40:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:58,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:58,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:58,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:40:58,548 INFO L87 Difference]: Start difference. First operand 927 states and 1192 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:58,861 INFO L93 Difference]: Finished difference Result 1853 states and 2376 transitions. [2025-02-06 03:40:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:58,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:58,865 INFO L225 Difference]: With dead ends: 1853 [2025-02-06 03:40:58,865 INFO L226 Difference]: Without dead ends: 948 [2025-02-06 03:40:58,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:40:58,867 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 120 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:58,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 600 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:40:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-02-06 03:40:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 888. [2025-02-06 03:40:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 692 states have (on average 1.2109826589595376) internal successors, (838), 703 states have internal predecessors, (838), 152 states have call successors, (152), 43 states have call predecessors, (152), 43 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 03:40:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1142 transitions. [2025-02-06 03:40:58,929 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1142 transitions. Word has length 118 [2025-02-06 03:40:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:58,929 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1142 transitions. [2025-02-06 03:40:58,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1142 transitions. [2025-02-06 03:40:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:58,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:58,930 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,938 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:40:59,131 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:40:59,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:59,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1373653865, now seen corresponding path program 1 times [2025-02-06 03:40:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874322815] [2025-02-06 03:40:59,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:59,132 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:40:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:59,133 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:40:59,134 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:40:59,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:59,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:59,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:59,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:59,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:40:59,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:59,347 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 12 treesize of output 8 [2025-02-06 03:40:59,368 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 37 treesize of output 25 [2025-02-06 03:40:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:59,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:59,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:59,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874322815] [2025-02-06 03:40:59,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874322815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:59,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:59,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:40:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321960003] [2025-02-06 03:40:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:59,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:59,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:59,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:40:59,384 INFO L87 Difference]: Start difference. First operand 888 states and 1142 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:59,518 INFO L93 Difference]: Finished difference Result 1974 states and 2547 transitions. [2025-02-06 03:40:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:59,522 INFO L225 Difference]: With dead ends: 1974 [2025-02-06 03:40:59,522 INFO L226 Difference]: Without dead ends: 1089 [2025-02-06 03:40:59,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:59,524 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 115 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:59,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1026 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-02-06 03:40:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1018. [2025-02-06 03:40:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 776 states have (on average 1.1920103092783505) internal successors, (925), 789 states have internal predecessors, (925), 188 states have call successors, (188), 53 states have call predecessors, (188), 53 states have return successors, (188), 175 states have call predecessors, (188), 188 states have call successors, (188) [2025-02-06 03:40:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1301 transitions. [2025-02-06 03:40:59,587 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1301 transitions. Word has length 118 [2025-02-06 03:40:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:59,587 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1301 transitions. [2025-02-06 03:40:59,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1301 transitions. [2025-02-06 03:40:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:59,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:59,589 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,597 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 (18)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:59,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:59,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1634071784, now seen corresponding path program 1 times [2025-02-06 03:40:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427122180] [2025-02-06 03:40:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:59,790 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:40:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:59,792 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:59,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:40:59,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:59,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:59,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:59,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:59,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:40:59,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:00,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2025-02-06 03:41:00,546 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 61 treesize of output 33 [2025-02-06 03:41:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-06 03:41:00,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:00,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427122180] [2025-02-06 03:41:00,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427122180] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:00,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:00,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-02-06 03:41:00,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617221172] [2025-02-06 03:41:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:00,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:41:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:00,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:41:00,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:41:00,715 INFO L87 Difference]: Start difference. First operand 1018 states and 1301 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:00,959 INFO L93 Difference]: Finished difference Result 1969 states and 2515 transitions. [2025-02-06 03:41:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:41:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:41:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:00,965 INFO L225 Difference]: With dead ends: 1969 [2025-02-06 03:41:00,965 INFO L226 Difference]: Without dead ends: 1025 [2025-02-06 03:41:00,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:41:00,967 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 51 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:00,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 541 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-02-06 03:41:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 995. [2025-02-06 03:41:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 762 states have (on average 1.1916010498687664) internal successors, (908), 774 states have internal predecessors, (908), 180 states have call successors, (180), 52 states have call predecessors, (180), 52 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 03:41:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1268 transitions. [2025-02-06 03:41:01,041 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1268 transitions. Word has length 118 [2025-02-06 03:41:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:01,042 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1268 transitions. [2025-02-06 03:41:01,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1268 transitions. [2025-02-06 03:41:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:41:01,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:01,045 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-06 03:41:01,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:41:01,245 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:01,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2041597811, now seen corresponding path program 1 times [2025-02-06 03:41:01,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:01,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410272074] [2025-02-06 03:41:01,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:01,246 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:41:01,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:01,248 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:41:01,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:41:01,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:41:01,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:41:01,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:01,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:41:01,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:02,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:41:02,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 54 [2025-02-06 03:41:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:41:02,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:03,200 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-02-06 03:41:03,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 93 [2025-02-06 03:41:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:08,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410272074] [2025-02-06 03:41:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410272074] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:08,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-06 03:41:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538070706] [2025-02-06 03:41:08,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:41:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:08,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:41:08,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2025-02-06 03:41:08,797 INFO L87 Difference]: Start difference. First operand 995 states and 1268 transitions. Second operand has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:10,707 INFO L93 Difference]: Finished difference Result 2594 states and 3251 transitions. [2025-02-06 03:41:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:41:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 120 [2025-02-06 03:41:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:10,715 INFO L225 Difference]: With dead ends: 2594 [2025-02-06 03:41:10,717 INFO L226 Difference]: Without dead ends: 1673 [2025-02-06 03:41:10,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=281, Invalid=908, Unknown=1, NotChecked=0, Total=1190 [2025-02-06 03:41:10,719 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 288 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:10,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1501 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:41:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-02-06 03:41:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 967. [2025-02-06 03:41:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 734 states have (on average 1.1825613079019073) internal successors, (868), 746 states have internal predecessors, (868), 180 states have call successors, (180), 52 states have call predecessors, (180), 52 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 03:41:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1228 transitions. [2025-02-06 03:41:10,790 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1228 transitions. Word has length 120 [2025-02-06 03:41:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1228 transitions. [2025-02-06 03:41:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1228 transitions. [2025-02-06 03:41:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:41:10,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:10,791 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:10,803 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 (20)] Ended with exit code 0 [2025-02-06 03:41:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:41:10,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -329475063, now seen corresponding path program 1 times [2025-02-06 03:41:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10821233] [2025-02-06 03:41:10,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:10,993 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:41:10,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:10,994 INFO L229 MonitoredProcess]: Starting monitored process 21 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:41:10,995 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 (21)] Waiting until timeout for monitored process [2025-02-06 03:41:11,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:41:11,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:41:11,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:11,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:41:11,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:11,403 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 12 treesize of output 8 [2025-02-06 03:41:11,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2025-02-06 03:41:11,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2025-02-06 03:41:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 214 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:41:11,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:11,646 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:11,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:41:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:11,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10821233] [2025-02-06 03:41:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10821233] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:11,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-02-06 03:41:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335834285] [2025-02-06 03:41:11,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:11,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:41:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:11,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:41:11,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:41:11,717 INFO L87 Difference]: Start difference. First operand 967 states and 1228 transitions. Second operand has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 19 states have internal predecessors, (78), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:12,471 INFO L93 Difference]: Finished difference Result 2743 states and 3379 transitions. [2025-02-06 03:41:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:41:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 19 states have internal predecessors, (78), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 120 [2025-02-06 03:41:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:12,478 INFO L225 Difference]: With dead ends: 2743 [2025-02-06 03:41:12,478 INFO L226 Difference]: Without dead ends: 1850 [2025-02-06 03:41:12,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 03:41:12,479 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 583 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:12,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1375 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:41:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-02-06 03:41:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1093. [2025-02-06 03:41:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 868 states have (on average 1.195852534562212) internal successors, (1038), 882 states have internal predecessors, (1038), 164 states have call successors, (164), 60 states have call predecessors, (164), 60 states have return successors, (164), 150 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 03:41:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1366 transitions. [2025-02-06 03:41:12,563 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1366 transitions. Word has length 120 [2025-02-06 03:41:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:12,563 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1366 transitions. [2025-02-06 03:41:12,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 19 states have internal predecessors, (78), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1366 transitions. [2025-02-06 03:41:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:41:12,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:12,565 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:12,573 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 (21)] Ended with exit code 0 [2025-02-06 03:41:12,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:41:12,765 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:12,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash -880571156, now seen corresponding path program 1 times [2025-02-06 03:41:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062723706] [2025-02-06 03:41:12,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:12,766 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:41:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:12,768 INFO L229 MonitoredProcess]: Starting monitored process 22 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:41:12,774 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 (22)] Waiting until timeout for monitored process [2025-02-06 03:41:12,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:41:12,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:41:12,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:12,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:12,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:41:12,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:13,152 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 18 treesize of output 10 [2025-02-06 03:41:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 8 proven. 204 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:41:13,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:13,285 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:13,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:41:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:13,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062723706] [2025-02-06 03:41:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062723706] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:13,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-02-06 03:41:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516349650] [2025-02-06 03:41:13,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:41:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:13,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:41:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:41:13,340 INFO L87 Difference]: Start difference. First operand 1093 states and 1366 transitions. Second operand has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:13,708 INFO L93 Difference]: Finished difference Result 2180 states and 2711 transitions. [2025-02-06 03:41:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:41:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 120 [2025-02-06 03:41:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:13,715 INFO L225 Difference]: With dead ends: 2180 [2025-02-06 03:41:13,715 INFO L226 Difference]: Without dead ends: 1169 [2025-02-06 03:41:13,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:41:13,716 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 317 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:13,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 470 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-02-06 03:41:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1093. [2025-02-06 03:41:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 868 states have (on average 1.1923963133640554) internal successors, (1035), 882 states have internal predecessors, (1035), 164 states have call successors, (164), 60 states have call predecessors, (164), 60 states have return successors, (164), 150 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 03:41:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1363 transitions. [2025-02-06 03:41:13,805 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1363 transitions. Word has length 120 [2025-02-06 03:41:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:13,806 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1363 transitions. [2025-02-06 03:41:13,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1363 transitions. [2025-02-06 03:41:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:41:13,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:13,807 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,816 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 (22)] Ended with exit code 0 [2025-02-06 03:41:14,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:41:14,008 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:14,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1554574607, now seen corresponding path program 1 times [2025-02-06 03:41:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:14,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127619587] [2025-02-06 03:41:14,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:14,009 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:41:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:14,011 INFO L229 MonitoredProcess]: Starting monitored process 23 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:41:14,011 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 (23)] Waiting until timeout for monitored process [2025-02-06 03:41:14,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:41:14,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:41:14,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:14,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:14,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:41:14,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:14,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:14,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:14,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127619587] [2025-02-06 03:41:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127619587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:14,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:14,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:41:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994618314] [2025-02-06 03:41:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:14,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:41:14,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:14,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:41:14,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:41:14,241 INFO L87 Difference]: Start difference. First operand 1093 states and 1363 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:14,362 INFO L93 Difference]: Finished difference Result 1127 states and 1404 transitions. [2025-02-06 03:41:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:41:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-02-06 03:41:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:14,368 INFO L225 Difference]: With dead ends: 1127 [2025-02-06 03:41:14,368 INFO L226 Difference]: Without dead ends: 1125 [2025-02-06 03:41:14,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:41:14,369 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:14,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-02-06 03:41:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2025-02-06 03:41:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 900 states have (on average 1.1855555555555555) internal successors, (1067), 914 states have internal predecessors, (1067), 164 states have call successors, (164), 60 states have call predecessors, (164), 60 states have return successors, (164), 150 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 03:41:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1395 transitions. [2025-02-06 03:41:14,472 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1395 transitions. Word has length 120 [2025-02-06 03:41:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:14,473 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1395 transitions. [2025-02-06 03:41:14,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1395 transitions. [2025-02-06 03:41:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:41:14,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:14,474 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:14,483 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 (23)] Ended with exit code 0 [2025-02-06 03:41:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:41:14,675 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:14,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1125735111, now seen corresponding path program 1 times [2025-02-06 03:41:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377864213] [2025-02-06 03:41:14,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:14,676 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:41:14,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:14,678 INFO L229 MonitoredProcess]: Starting monitored process 24 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:41:14,679 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 (24)] Waiting until timeout for monitored process [2025-02-06 03:41:14,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:41:14,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:41:14,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:14,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:14,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:41:14,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:14,917 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 12 treesize of output 8 [2025-02-06 03:41:14,938 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 37 treesize of output 25 [2025-02-06 03:41:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:14,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:14,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377864213] [2025-02-06 03:41:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377864213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:14,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:41:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187110633] [2025-02-06 03:41:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:14,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:41:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:14,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:41:14,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:14,965 INFO L87 Difference]: Start difference. First operand 1125 states and 1395 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:15,231 INFO L93 Difference]: Finished difference Result 2902 states and 3600 transitions. [2025-02-06 03:41:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:41:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:41:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:15,238 INFO L225 Difference]: With dead ends: 2902 [2025-02-06 03:41:15,238 INFO L226 Difference]: Without dead ends: 1859 [2025-02-06 03:41:15,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:41:15,241 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 111 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:15,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1200 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-02-06 03:41:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1658. [2025-02-06 03:41:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1325 states have (on average 1.1803773584905661) internal successors, (1564), 1345 states have internal predecessors, (1564), 240 states have call successors, (240), 92 states have call predecessors, (240), 92 states have return successors, (240), 220 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-06 03:41:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2044 transitions. [2025-02-06 03:41:15,380 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2044 transitions. Word has length 121 [2025-02-06 03:41:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2044 transitions. [2025-02-06 03:41:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2044 transitions. [2025-02-06 03:41:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:41:15,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:15,383 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,392 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 (24)] Ended with exit code 0 [2025-02-06 03:41:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:41:15,583 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -816430877, now seen corresponding path program 1 times [2025-02-06 03:41:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497662346] [2025-02-06 03:41:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:15,584 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:41:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:15,586 INFO L229 MonitoredProcess]: Starting monitored process 25 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:41:15,587 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 (25)] Waiting until timeout for monitored process [2025-02-06 03:41:15,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:41:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:41:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:41:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:16,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:41:16,017 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 13 treesize of output 9 [2025-02-06 03:41:16,063 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 38 treesize of output 26 [2025-02-06 03:41:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 214 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:41:16,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:16,287 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:16,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:41:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:16,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497662346] [2025-02-06 03:41:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497662346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:16,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-02-06 03:41:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487063892] [2025-02-06 03:41:16,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:16,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:41:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:16,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:41:16,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:41:16,351 INFO L87 Difference]: Start difference. First operand 1658 states and 2044 transitions. Second operand has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 19 states have internal predecessors, (80), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:17,602 INFO L93 Difference]: Finished difference Result 4153 states and 5073 transitions. [2025-02-06 03:41:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 03:41:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 19 states have internal predecessors, (80), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 121 [2025-02-06 03:41:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:17,610 INFO L225 Difference]: With dead ends: 4153 [2025-02-06 03:41:17,610 INFO L226 Difference]: Without dead ends: 2498 [2025-02-06 03:41:17,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1411, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 03:41:17,613 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 553 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:17,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1733 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:41:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2025-02-06 03:41:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 1630. [2025-02-06 03:41:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1279 states have (on average 1.169663799843628) internal successors, (1496), 1299 states have internal predecessors, (1496), 252 states have call successors, (252), 98 states have call predecessors, (252), 98 states have return successors, (252), 232 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 03:41:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2000 transitions. [2025-02-06 03:41:17,830 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2000 transitions. Word has length 121 [2025-02-06 03:41:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:17,830 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2000 transitions. [2025-02-06 03:41:17,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 19 states have internal predecessors, (80), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2000 transitions. [2025-02-06 03:41:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:41:17,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:17,831 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:17,840 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 (25)] Ended with exit code 0 [2025-02-06 03:41:18,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:41:18,032 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:18,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash 973899275, now seen corresponding path program 1 times [2025-02-06 03:41:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724569398] [2025-02-06 03:41:18,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:18,033 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:41:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:18,034 INFO L229 MonitoredProcess]: Starting monitored process 26 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:41:18,036 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 (26)] Waiting until timeout for monitored process [2025-02-06 03:41:18,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:41:18,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:41:18,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:18,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:41:18,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:18,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-06 03:41:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 8 proven. 204 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:41:18,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:18,554 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:18,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:41:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:18,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724569398] [2025-02-06 03:41:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724569398] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:18,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-02-06 03:41:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771419739] [2025-02-06 03:41:18,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:41:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:18,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:41:18,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:41:18,622 INFO L87 Difference]: Start difference. First operand 1630 states and 2000 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:19,031 INFO L93 Difference]: Finished difference Result 3377 states and 4117 transitions. [2025-02-06 03:41:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:41:19,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 122 [2025-02-06 03:41:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:19,038 INFO L225 Difference]: With dead ends: 3377 [2025-02-06 03:41:19,038 INFO L226 Difference]: Without dead ends: 1750 [2025-02-06 03:41:19,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:41:19,042 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 309 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:19,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 464 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2025-02-06 03:41:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1630. [2025-02-06 03:41:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1279 states have (on average 1.1673182173573105) internal successors, (1493), 1299 states have internal predecessors, (1493), 252 states have call successors, (252), 98 states have call predecessors, (252), 98 states have return successors, (252), 232 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 03:41:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1997 transitions. [2025-02-06 03:41:19,188 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1997 transitions. Word has length 122 [2025-02-06 03:41:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:19,189 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 1997 transitions. [2025-02-06 03:41:19,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1997 transitions. [2025-02-06 03:41:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:41:19,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:19,190 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:19,199 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 (26)] Ended with exit code 0 [2025-02-06 03:41:19,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:41:19,391 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:19,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1283011732, now seen corresponding path program 1 times [2025-02-06 03:41:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448405092] [2025-02-06 03:41:19,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:19,392 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:41:19,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:19,394 INFO L229 MonitoredProcess]: Starting monitored process 27 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:41:19,396 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 (27)] Waiting until timeout for monitored process [2025-02-06 03:41:19,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:41:19,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:41:19,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:19,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:19,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:41:19,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:19,833 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 12 treesize of output 8 [2025-02-06 03:41:19,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2025-02-06 03:41:19,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2025-02-06 03:41:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 214 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:41:19,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:19,976 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 26 treesize of output 22 [2025-02-06 03:41:19,979 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 03:41:19,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:41:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2025-02-06 03:41:19,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2025-02-06 03:41:20,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39 treesize of output 35 [2025-02-06 03:41:20,204 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:20,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2025-02-06 03:41:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:20,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:20,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448405092] [2025-02-06 03:41:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448405092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:20,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2025-02-06 03:41:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890746000] [2025-02-06 03:41:20,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:20,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:41:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:20,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:41:20,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:41:20,270 INFO L87 Difference]: Start difference. First operand 1630 states and 1997 transitions. Second operand has 22 states, 20 states have (on average 4.8) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-06 03:41:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:21,314 INFO L93 Difference]: Finished difference Result 4018 states and 4848 transitions. [2025-02-06 03:41:21,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:41:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.8) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 122 [2025-02-06 03:41:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:21,322 INFO L225 Difference]: With dead ends: 4018 [2025-02-06 03:41:21,322 INFO L226 Difference]: Without dead ends: 2391 [2025-02-06 03:41:21,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 03:41:21,325 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 255 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:21,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1771 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:41:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2025-02-06 03:41:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 1695. [2025-02-06 03:41:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1332 states have (on average 1.1606606606606606) internal successors, (1546), 1354 states have internal predecessors, (1546), 260 states have call successors, (260), 102 states have call predecessors, (260), 102 states have return successors, (260), 238 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 03:41:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2066 transitions. [2025-02-06 03:41:21,511 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2066 transitions. Word has length 122 [2025-02-06 03:41:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:21,512 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2066 transitions. [2025-02-06 03:41:21,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.8) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-06 03:41:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2066 transitions. [2025-02-06 03:41:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:41:21,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:21,514 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,523 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 (27)] Ended with exit code 0 [2025-02-06 03:41:21,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:41:21,716 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:21,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash -13623343, now seen corresponding path program 1 times [2025-02-06 03:41:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:21,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964572146] [2025-02-06 03:41:21,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:21,717 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:41:21,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:21,719 INFO L229 MonitoredProcess]: Starting monitored process 28 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:41:21,721 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 (28)] Waiting until timeout for monitored process [2025-02-06 03:41:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:41:21,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:41:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:21,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:21,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:41:21,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:22,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:41:23,253 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 28 treesize of output 20 [2025-02-06 03:41:23,256 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 24 treesize of output 16 [2025-02-06 03:41:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 03:41:23,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:25,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964572146] [2025-02-06 03:41:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964572146] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 03:41:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102386884] [2025-02-06 03:41:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:41:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:25,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:41:25,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:41:25,797 INFO L87 Difference]: Start difference. First operand 1695 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:28,014 INFO L93 Difference]: Finished difference Result 4006 states and 4897 transitions. [2025-02-06 03:41:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:41:28,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-02-06 03:41:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:28,028 INFO L225 Difference]: With dead ends: 4006 [2025-02-06 03:41:28,029 INFO L226 Difference]: Without dead ends: 2314 [2025-02-06 03:41:28,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:41:28,031 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 39 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:28,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 416 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 03:41:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-02-06 03:41:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2207. [2025-02-06 03:41:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 1844 states have (on average 1.185466377440347) internal successors, (2186), 1866 states have internal predecessors, (2186), 260 states have call successors, (260), 102 states have call predecessors, (260), 102 states have return successors, (260), 238 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 03:41:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2706 transitions. [2025-02-06 03:41:28,195 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 2706 transitions. Word has length 122 [2025-02-06 03:41:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:28,195 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 2706 transitions. [2025-02-06 03:41:28,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2706 transitions. [2025-02-06 03:41:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:28,196 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,205 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 (28)] Ended with exit code 0 [2025-02-06 03:41:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:41:28,399 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1347782356, now seen corresponding path program 1 times [2025-02-06 03:41:28,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:28,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603237181] [2025-02-06 03:41:28,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:28,400 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:41:28,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:28,401 INFO L229 MonitoredProcess]: Starting monitored process 29 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:41:28,403 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 (29)] Waiting until timeout for monitored process [2025-02-06 03:41:28,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:28,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:28,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:28,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:28,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:41:28,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:28,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2025-02-06 03:41:28,719 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 39 treesize of output 27 [2025-02-06 03:41:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:29,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:29,136 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603237181] [2025-02-06 03:41:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603237181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:29,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:29,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:41:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276332745] [2025-02-06 03:41:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:29,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:41:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:29,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:41:29,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:29,136 INFO L87 Difference]: Start difference. First operand 2207 states and 2706 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:31,803 INFO L93 Difference]: Finished difference Result 4228 states and 5179 transitions. [2025-02-06 03:41:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:41:31,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:31,811 INFO L225 Difference]: With dead ends: 4228 [2025-02-06 03:41:31,811 INFO L226 Difference]: Without dead ends: 3188 [2025-02-06 03:41:31,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:41:31,813 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 187 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:31,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 728 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 03:41:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2025-02-06 03:41:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 2249. [2025-02-06 03:41:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 1886 states have (on average 1.1876988335100742) internal successors, (2240), 1908 states have internal predecessors, (2240), 260 states have call successors, (260), 102 states have call predecessors, (260), 102 states have return successors, (260), 238 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-06 03:41:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2760 transitions. [2025-02-06 03:41:31,980 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2760 transitions. Word has length 123 [2025-02-06 03:41:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:31,980 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 2760 transitions. [2025-02-06 03:41:31,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2760 transitions. [2025-02-06 03:41:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:31,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:31,981 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,990 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 (29)] Ended with exit code 0 [2025-02-06 03:41:32,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:41:32,182 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:32,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1646965620, now seen corresponding path program 1 times [2025-02-06 03:41:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177404937] [2025-02-06 03:41:32,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:32,183 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:41:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:32,185 INFO L229 MonitoredProcess]: Starting monitored process 30 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:41:32,186 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 (30)] Waiting until timeout for monitored process [2025-02-06 03:41:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:32,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:32,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:32,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:32,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:41:32,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:32,664 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 17 treesize of output 13 [2025-02-06 03:41:32,713 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 54 treesize of output 42 [2025-02-06 03:41:32,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-02-06 03:41:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-06 03:41:32,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:32,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177404937] [2025-02-06 03:41:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177404937] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-02-06 03:41:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822513928] [2025-02-06 03:41:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:41:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:32,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:41:32,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:41:32,958 INFO L87 Difference]: Start difference. First operand 2249 states and 2760 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:33,448 INFO L93 Difference]: Finished difference Result 3114 states and 3810 transitions. [2025-02-06 03:41:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:41:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:33,458 INFO L225 Difference]: With dead ends: 3114 [2025-02-06 03:41:33,458 INFO L226 Difference]: Without dead ends: 3112 [2025-02-06 03:41:33,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:41:33,459 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 92 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:33,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1358 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2025-02-06 03:41:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3028. [2025-02-06 03:41:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2511 states have (on average 1.183193946634807) internal successors, (2971), 2545 states have internal predecessors, (2971), 368 states have call successors, (368), 148 states have call predecessors, (368), 148 states have return successors, (368), 334 states have call predecessors, (368), 368 states have call successors, (368) [2025-02-06 03:41:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3707 transitions. [2025-02-06 03:41:33,693 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3707 transitions. Word has length 123 [2025-02-06 03:41:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:33,693 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 3707 transitions. [2025-02-06 03:41:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3707 transitions. [2025-02-06 03:41:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:33,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:33,695 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,706 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 (30)] Ended with exit code 0 [2025-02-06 03:41:33,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:41:33,896 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:33,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -953863923, now seen corresponding path program 1 times [2025-02-06 03:41:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:33,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375783127] [2025-02-06 03:41:33,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:33,897 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:41:33,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:33,899 INFO L229 MonitoredProcess]: Starting monitored process 31 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:41:33,901 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 (31)] Waiting until timeout for monitored process [2025-02-06 03:41:34,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:34,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:34,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:34,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:34,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:41:34,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:34,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:41:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:34,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:34,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:34,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375783127] [2025-02-06 03:41:34,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375783127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:34,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:41:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168482511] [2025-02-06 03:41:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:34,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:41:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:34,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:41:34,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:41:34,227 INFO L87 Difference]: Start difference. First operand 3028 states and 3707 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:34,843 INFO L93 Difference]: Finished difference Result 7969 states and 9748 transitions. [2025-02-06 03:41:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:41:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:34,855 INFO L225 Difference]: With dead ends: 7969 [2025-02-06 03:41:34,855 INFO L226 Difference]: Without dead ends: 4944 [2025-02-06 03:41:34,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:41:34,860 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 167 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:34,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 346 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2025-02-06 03:41:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4386. [2025-02-06 03:41:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 3567 states have (on average 1.167928231006448) internal successors, (4166), 3621 states have internal predecessors, (4166), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 5342 transitions. [2025-02-06 03:41:35,241 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 5342 transitions. Word has length 123 [2025-02-06 03:41:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:35,241 INFO L471 AbstractCegarLoop]: Abstraction has 4386 states and 5342 transitions. [2025-02-06 03:41:35,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 5342 transitions. [2025-02-06 03:41:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:35,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:35,242 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,251 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 (31)] Ended with exit code 0 [2025-02-06 03:41:35,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:41:35,443 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1630869444, now seen corresponding path program 1 times [2025-02-06 03:41:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309309954] [2025-02-06 03:41:35,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:35,445 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:41:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:35,447 INFO L229 MonitoredProcess]: Starting monitored process 32 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:41:35,450 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 (32)] Waiting until timeout for monitored process [2025-02-06 03:41:35,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:35,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:35,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:35,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:35,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:41:35,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:35,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:41:35,994 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 20 treesize of output 12 [2025-02-06 03:41:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:36,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:36,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309309954] [2025-02-06 03:41:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309309954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:36,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:36,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:41:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926677165] [2025-02-06 03:41:36,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:36,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:41:36,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:36,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:41:36,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:41:36,017 INFO L87 Difference]: Start difference. First operand 4386 states and 5342 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:36,912 INFO L93 Difference]: Finished difference Result 7529 states and 9184 transitions. [2025-02-06 03:41:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:41:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:36,923 INFO L225 Difference]: With dead ends: 7529 [2025-02-06 03:41:36,923 INFO L226 Difference]: Without dead ends: 4504 [2025-02-06 03:41:36,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:41:36,929 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 147 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:36,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 963 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:41:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2025-02-06 03:41:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 4400. [2025-02-06 03:41:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 3581 states have (on average 1.1683887182351298) internal successors, (4184), 3635 states have internal predecessors, (4184), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 5360 transitions. [2025-02-06 03:41:37,407 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 5360 transitions. Word has length 123 [2025-02-06 03:41:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 4400 states and 5360 transitions. [2025-02-06 03:41:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 5360 transitions. [2025-02-06 03:41:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:37,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:37,409 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:37,418 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 (32)] Ended with exit code 0 [2025-02-06 03:41:37,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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:41:37,610 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:37,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1125310819, now seen corresponding path program 1 times [2025-02-06 03:41:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317691156] [2025-02-06 03:41:37,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:37,611 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:41:37,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:37,613 INFO L229 MonitoredProcess]: Starting monitored process 33 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:41:37,615 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 (33)] Waiting until timeout for monitored process [2025-02-06 03:41:37,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:37,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:37,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:37,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:37,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:41:37,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:38,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:41:38,110 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 19 treesize of output 11 [2025-02-06 03:41:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:38,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:38,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317691156] [2025-02-06 03:41:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317691156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:38,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:41:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071712315] [2025-02-06 03:41:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:41:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:38,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:41:38,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:41:38,132 INFO L87 Difference]: Start difference. First operand 4400 states and 5360 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:38,894 INFO L93 Difference]: Finished difference Result 7541 states and 9196 transitions. [2025-02-06 03:41:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:41:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:38,905 INFO L225 Difference]: With dead ends: 7541 [2025-02-06 03:41:38,905 INFO L226 Difference]: Without dead ends: 4502 [2025-02-06 03:41:38,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:41:38,911 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 127 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:38,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 867 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:41:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2025-02-06 03:41:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4400. [2025-02-06 03:41:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 3581 states have (on average 1.1678302150237363) internal successors, (4182), 3635 states have internal predecessors, (4182), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 5358 transitions. [2025-02-06 03:41:39,304 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 5358 transitions. Word has length 123 [2025-02-06 03:41:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:39,305 INFO L471 AbstractCegarLoop]: Abstraction has 4400 states and 5358 transitions. [2025-02-06 03:41:39,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 5358 transitions. [2025-02-06 03:41:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:39,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:39,307 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:39,320 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 (33)] Ended with exit code 0 [2025-02-06 03:41:39,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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:41:39,507 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:39,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash -471649590, now seen corresponding path program 1 times [2025-02-06 03:41:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:39,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810676459] [2025-02-06 03:41:39,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:39,508 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:41:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:39,510 INFO L229 MonitoredProcess]: Starting monitored process 34 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:41:39,511 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 (34)] Waiting until timeout for monitored process [2025-02-06 03:41:39,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:39,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:39,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:39,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:39,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:41:39,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:39,784 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 19 treesize of output 11 [2025-02-06 03:41:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:39,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:39,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810676459] [2025-02-06 03:41:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810676459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:41:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365259930] [2025-02-06 03:41:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:41:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:39,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:41:39,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:41:39,804 INFO L87 Difference]: Start difference. First operand 4400 states and 5358 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:40,354 INFO L93 Difference]: Finished difference Result 8125 states and 9933 transitions. [2025-02-06 03:41:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:41:40,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:40,366 INFO L225 Difference]: With dead ends: 8125 [2025-02-06 03:41:40,366 INFO L226 Difference]: Without dead ends: 5039 [2025-02-06 03:41:40,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:40,371 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 68 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:40,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 635 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2025-02-06 03:41:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 4498. [2025-02-06 03:41:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 3679 states have (on average 1.1731448763250882) internal successors, (4316), 3733 states have internal predecessors, (4316), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 5492 transitions. [2025-02-06 03:41:40,779 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 5492 transitions. Word has length 123 [2025-02-06 03:41:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:40,779 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 5492 transitions. [2025-02-06 03:41:40,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 5492 transitions. [2025-02-06 03:41:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:40,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:40,780 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:40,788 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 (34)] Ended with exit code 0 [2025-02-06 03:41:40,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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:41:40,981 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:40,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash -982183767, now seen corresponding path program 1 times [2025-02-06 03:41:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451288717] [2025-02-06 03:41:40,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:40,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:41:40,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:40,983 INFO L229 MonitoredProcess]: Starting monitored process 35 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:41:40,984 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 (35)] Waiting until timeout for monitored process [2025-02-06 03:41:41,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:41,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:41,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:41,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:41,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:41:41,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:41,385 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 18 treesize of output 10 [2025-02-06 03:41:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:41,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:41,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451288717] [2025-02-06 03:41:41,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451288717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:41,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:41,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:41:41,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994188051] [2025-02-06 03:41:41,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:41,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:41:41,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:41,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:41:41,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:41:41,393 INFO L87 Difference]: Start difference. First operand 4498 states and 5492 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:42,041 INFO L93 Difference]: Finished difference Result 7632 states and 9348 transitions. [2025-02-06 03:41:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:41:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:42,053 INFO L225 Difference]: With dead ends: 7632 [2025-02-06 03:41:42,053 INFO L226 Difference]: Without dead ends: 4516 [2025-02-06 03:41:42,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:41:42,058 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 56 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 343 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:42,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 343 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2025-02-06 03:41:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4510. [2025-02-06 03:41:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 3691 states have (on average 1.1725819561094555) internal successors, (4328), 3745 states have internal predecessors, (4328), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5504 transitions. [2025-02-06 03:41:42,480 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5504 transitions. Word has length 123 [2025-02-06 03:41:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:42,480 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5504 transitions. [2025-02-06 03:41:42,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5504 transitions. [2025-02-06 03:41:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:42,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:42,481 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,489 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 (35)] Ended with exit code 0 [2025-02-06 03:41:42,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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:41:42,682 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:42,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1417609702, now seen corresponding path program 1 times [2025-02-06 03:41:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:42,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876098929] [2025-02-06 03:41:42,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:42,683 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:41:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:42,684 INFO L229 MonitoredProcess]: Starting monitored process 36 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:41:42,685 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 (36)] Waiting until timeout for monitored process [2025-02-06 03:41:42,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:42,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:42,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:42,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:42,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:41:42,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:43,148 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 17 treesize of output 13 [2025-02-06 03:41:43,198 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 22 treesize of output 14 [2025-02-06 03:41:43,217 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 27 [2025-02-06 03:41:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 214 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:41:43,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:43,743 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:43,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-02-06 03:41:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:43,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876098929] [2025-02-06 03:41:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876098929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:43,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2025-02-06 03:41:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094647023] [2025-02-06 03:41:43,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 03:41:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:43,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 03:41:43,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:41:43,834 INFO L87 Difference]: Start difference. First operand 4510 states and 5504 transitions. Second operand has 24 states, 22 states have (on average 4.454545454545454) internal successors, (98), 24 states have internal predecessors, (98), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-06 03:41:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:45,324 INFO L93 Difference]: Finished difference Result 8136 states and 9868 transitions. [2025-02-06 03:41:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:41:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.454545454545454) internal successors, (98), 24 states have internal predecessors, (98), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 123 [2025-02-06 03:41:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:45,335 INFO L225 Difference]: With dead ends: 8136 [2025-02-06 03:41:45,336 INFO L226 Difference]: Without dead ends: 4988 [2025-02-06 03:41:45,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=1502, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 03:41:45,340 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 316 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:45,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1656 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:41:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-02-06 03:41:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4534. [2025-02-06 03:41:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 3715 states have (on average 1.1714670255720054) internal successors, (4352), 3769 states have internal predecessors, (4352), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5528 transitions. [2025-02-06 03:41:45,706 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5528 transitions. Word has length 123 [2025-02-06 03:41:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:45,707 INFO L471 AbstractCegarLoop]: Abstraction has 4534 states and 5528 transitions. [2025-02-06 03:41:45,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.454545454545454) internal successors, (98), 24 states have internal predecessors, (98), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-06 03:41:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5528 transitions. [2025-02-06 03:41:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:45,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:45,708 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,716 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 (36)] Ended with exit code 0 [2025-02-06 03:41:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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:41:45,909 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 912051077, now seen corresponding path program 1 times [2025-02-06 03:41:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741524417] [2025-02-06 03:41:45,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:45,909 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:41:45,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:45,911 INFO L229 MonitoredProcess]: Starting monitored process 37 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:41:45,912 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 (37)] Waiting until timeout for monitored process [2025-02-06 03:41:46,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:46,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:46,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:46,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:46,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:41:46,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:46,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-06 03:41:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 8 proven. 204 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:41:46,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:46,521 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:46,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:41:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:46,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741524417] [2025-02-06 03:41:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741524417] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:46,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-02-06 03:41:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689699622] [2025-02-06 03:41:46,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:46,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:41:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:46,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:41:46,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:41:46,592 INFO L87 Difference]: Start difference. First operand 4534 states and 5528 transitions. Second operand has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:47,257 INFO L93 Difference]: Finished difference Result 7884 states and 9557 transitions. [2025-02-06 03:41:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:41:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 123 [2025-02-06 03:41:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:47,269 INFO L225 Difference]: With dead ends: 7884 [2025-02-06 03:41:47,269 INFO L226 Difference]: Without dead ends: 4636 [2025-02-06 03:41:47,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:41:47,274 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 213 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:47,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 458 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2025-02-06 03:41:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 4352. [2025-02-06 03:41:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 3533 states have (on average 1.1519954712708746) internal successors, (4070), 3587 states have internal predecessors, (4070), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 5246 transitions. [2025-02-06 03:41:47,691 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 5246 transitions. Word has length 123 [2025-02-06 03:41:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 4352 states and 5246 transitions. [2025-02-06 03:41:47,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-06 03:41:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 5246 transitions. [2025-02-06 03:41:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:41:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:47,693 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,702 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 (37)] Ended with exit code 0 [2025-02-06 03:41:47,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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:41:47,895 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:47,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1376132899, now seen corresponding path program 1 times [2025-02-06 03:41:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428881412] [2025-02-06 03:41:47,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:47,895 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:41:47,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:47,897 INFO L229 MonitoredProcess]: Starting monitored process 38 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:41:47,898 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 (38)] Waiting until timeout for monitored process [2025-02-06 03:41:48,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:41:48,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:41:48,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:48,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:48,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:41:48,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:48,253 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 18 treesize of output 10 [2025-02-06 03:41:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:48,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:48,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428881412] [2025-02-06 03:41:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428881412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:41:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787358] [2025-02-06 03:41:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:48,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:41:48,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:48,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:41:48,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:41:48,266 INFO L87 Difference]: Start difference. First operand 4352 states and 5246 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:48,732 INFO L93 Difference]: Finished difference Result 7271 states and 8761 transitions. [2025-02-06 03:41:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:41:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:41:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:48,741 INFO L225 Difference]: With dead ends: 7271 [2025-02-06 03:41:48,741 INFO L226 Difference]: Without dead ends: 4277 [2025-02-06 03:41:48,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:48,745 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 78 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:48,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 489 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2025-02-06 03:41:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 4250. [2025-02-06 03:41:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3431 states have (on average 1.1471874089186826) internal successors, (3936), 3485 states have internal predecessors, (3936), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 5112 transitions. [2025-02-06 03:41:49,112 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 5112 transitions. Word has length 123 [2025-02-06 03:41:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:49,112 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 5112 transitions. [2025-02-06 03:41:49,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 5112 transitions. [2025-02-06 03:41:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:41:49,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:49,113 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,121 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 (38)] Ended with exit code 0 [2025-02-06 03:41:49,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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:41:49,314 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:49,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1758100887, now seen corresponding path program 1 times [2025-02-06 03:41:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338231508] [2025-02-06 03:41:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:49,314 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:41:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:49,316 INFO L229 MonitoredProcess]: Starting monitored process 39 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:41:49,317 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 (39)] Waiting until timeout for monitored process [2025-02-06 03:41:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:41:49,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:41:49,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:49,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:49,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:41:49,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:49,628 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 20 treesize of output 12 [2025-02-06 03:41:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:41:49,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:49,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338231508] [2025-02-06 03:41:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338231508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:41:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351583564] [2025-02-06 03:41:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:41:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:49,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:41:49,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:41:49,652 INFO L87 Difference]: Start difference. First operand 4250 states and 5112 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:50,211 INFO L93 Difference]: Finished difference Result 6642 states and 8031 transitions. [2025-02-06 03:41:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:41:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-02-06 03:41:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:50,221 INFO L225 Difference]: With dead ends: 6642 [2025-02-06 03:41:50,221 INFO L226 Difference]: Without dead ends: 4762 [2025-02-06 03:41:50,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:50,224 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 65 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:50,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 736 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2025-02-06 03:41:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4318. [2025-02-06 03:41:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4318 states, 3499 states have (on average 1.1523292369248357) internal successors, (4032), 3553 states have internal predecessors, (4032), 588 states have call successors, (588), 230 states have call predecessors, (588), 230 states have return successors, (588), 534 states have call predecessors, (588), 588 states have call successors, (588) [2025-02-06 03:41:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 5208 transitions. [2025-02-06 03:41:50,600 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 5208 transitions. Word has length 124 [2025-02-06 03:41:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:50,600 INFO L471 AbstractCegarLoop]: Abstraction has 4318 states and 5208 transitions. [2025-02-06 03:41:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:41:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 5208 transitions. [2025-02-06 03:41:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:41:50,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:50,601 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,609 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 (39)] Ended with exit code 0 [2025-02-06 03:41:50,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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:41:50,802 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2031307784, now seen corresponding path program 1 times [2025-02-06 03:41:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:41:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239337063] [2025-02-06 03:41:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:50,803 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:41:50,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:41:50,804 INFO L229 MonitoredProcess]: Starting monitored process 40 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:41:50,805 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 (40)] Waiting until timeout for monitored process [2025-02-06 03:41:50,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:41:51,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:41:51,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:51,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:41:51,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:51,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-06 03:41:51,312 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 12 treesize of output 8 [2025-02-06 03:41:51,336 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 37 treesize of output 25 [2025-02-06 03:41:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 214 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:41:51,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:51,454 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 26 treesize of output 22 [2025-02-06 03:41:51,456 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 03:41:51,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:41:51,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2025-02-06 03:41:51,628 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:41:51,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:41:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:41:51,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:41:51,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239337063] [2025-02-06 03:41:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239337063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:51,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:41:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2025-02-06 03:41:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666036179] [2025-02-06 03:41:51,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:41:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:41:51,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:41:51,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:41:51,703 INFO L87 Difference]: Start difference. First operand 4318 states and 5208 transitions. Second operand has 20 states, 18 states have (on average 4.611111111111111) internal successors, (83), 20 states have internal predecessors, (83), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28)