./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.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 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:15:37,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:15:37,174 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:15:37,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:15:37,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:15:37,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:15:37,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:15:37,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:15:37,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:15:37,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:15:37,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:15:37,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:15:37,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:15:37,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:15:37,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:15:37,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:15:37,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:15:37,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:15:37,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:15:37,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:15:37,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:15:37,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:15:37,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:15:37,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:15:37,202 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 -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2025-02-06 03:15:37,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:15:37,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:15:37,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:15:37,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:15:37,489 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:15:37,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-02-06 03:15:38,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62ade4d43/151046ef227e4cdba7dc2a7dc4fbc186/FLAG4f04341bb [2025-02-06 03:15:38,863 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:15:38,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-02-06 03:15:38,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62ade4d43/151046ef227e4cdba7dc2a7dc4fbc186/FLAG4f04341bb [2025-02-06 03:15:39,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62ade4d43/151046ef227e4cdba7dc2a7dc4fbc186 [2025-02-06 03:15:39,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:15:39,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:15:39,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:15:39,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:15:39,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:15:39,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537c6340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39, skipping insertion in model container [2025-02-06 03:15:39,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:15:39,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-02-06 03:15:39,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:15:39,374 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:15:39,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-02-06 03:15:39,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:15:39,430 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:15:39,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39 WrapperNode [2025-02-06 03:15:39,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:15:39,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:15:39,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:15:39,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:15:39,436 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:15:39" (1/1) ... [2025-02-06 03:15:39,448 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:15:39" (1/1) ... [2025-02-06 03:15:39,492 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-02-06 03:15:39,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:15:39,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:15:39,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:15:39,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:15:39,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,519 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2025-02-06 03:15:39,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:15:39,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:15:39,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:15:39,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:15:39,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (1/1) ... [2025-02-06 03:15:39,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:15:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:15:39,576 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:15:39,581 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:15:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:15:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:15:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:15:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:15:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:15:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:15:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:15:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:15:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:15:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:15:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:15:39,706 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:15:39,707 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:15:40,090 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-02-06 03:15:40,122 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-02-06 03:15:40,123 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:15:40,134 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:15:40,134 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:15:40,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:40 BoogieIcfgContainer [2025-02-06 03:15:40,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:15:40,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:15:40,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:15:40,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:15:40,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:15:39" (1/3) ... [2025-02-06 03:15:40,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279bdcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:15:40, skipping insertion in model container [2025-02-06 03:15:40,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:39" (2/3) ... [2025-02-06 03:15:40,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279bdcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:15:40, skipping insertion in model container [2025-02-06 03:15:40,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:40" (3/3) ... [2025-02-06 03:15:40,141 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2025-02-06 03:15:40,153 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:15:40,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:15:40,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:15:40,200 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;@27e03259, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:15:40,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:15:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:40,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:40,213 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:40,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1254385902, now seen corresponding path program 1 times [2025-02-06 03:15:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452388047] [2025-02-06 03:15:40,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:40,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:40,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:15:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452388047] [2025-02-06 03:15:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452388047] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739970582] [2025-02-06 03:15:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:15:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:15:40,485 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:15:40,487 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:15:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:40,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:40,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:40,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:15:40,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:15:40,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:40,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739970582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:40,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:40,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:15:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112040217] [2025-02-06 03:15:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:40,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:15:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:40,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:15:40,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:15:40,722 INFO L87 Difference]: Start difference. First operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:40,740 INFO L93 Difference]: Finished difference Result 192 states and 290 transitions. [2025-02-06 03:15:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:15:40,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:15:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:40,746 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:15:40,746 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:15:40,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:15:40,750 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:40,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:15:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 03:15:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-02-06 03:15:40,780 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2025-02-06 03:15:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:40,780 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-02-06 03:15:40,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-02-06 03:15:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:40,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:40,783 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:40,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:15:40,987 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:15:40,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1303725911, now seen corresponding path program 1 times [2025-02-06 03:15:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829131412] [2025-02-06 03:15:40,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:41,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:41,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:41,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:41,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:41,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:41,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829131412] [2025-02-06 03:15:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829131412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:41,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:41,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720553966] [2025-02-06 03:15:41,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:41,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:41,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:41,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:41,231 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:41,254 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2025-02-06 03:15:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:15:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:41,255 INFO L225 Difference]: With dead ends: 191 [2025-02-06 03:15:41,255 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:15:41,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:41,256 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:41,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:15:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:15:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-02-06 03:15:41,262 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103 [2025-02-06 03:15:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:41,263 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-02-06 03:15:41,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-02-06 03:15:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:41,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:41,264 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:41,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:15:41,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1063185782, now seen corresponding path program 1 times [2025-02-06 03:15:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337856234] [2025-02-06 03:15:41,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:41,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:41,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:41,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337856234] [2025-02-06 03:15:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337856234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099499247] [2025-02-06 03:15:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:41,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:41,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:41,569 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:41,641 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2025-02-06 03:15:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:41,644 INFO L225 Difference]: With dead ends: 193 [2025-02-06 03:15:41,644 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:15:41,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:41,647 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:41,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:15:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:15:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-02-06 03:15:41,659 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 103 [2025-02-06 03:15:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:41,660 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-02-06 03:15:41,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-02-06 03:15:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:41,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:41,661 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:41,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:15:41,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:41,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1154572171, now seen corresponding path program 1 times [2025-02-06 03:15:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946852966] [2025-02-06 03:15:41,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:41,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:41,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:41,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:41,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:41,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946852966] [2025-02-06 03:15:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946852966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:41,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875891583] [2025-02-06 03:15:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:41,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:41,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:41,921 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:41,965 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2025-02-06 03:15:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:41,968 INFO L225 Difference]: With dead ends: 191 [2025-02-06 03:15:41,968 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:15:41,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:41,970 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 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:15:41,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:15:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 03:15:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2025-02-06 03:15:41,978 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 103 [2025-02-06 03:15:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:41,978 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2025-02-06 03:15:41,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2025-02-06 03:15:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:41,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:41,979 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:41,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:15:41,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:41,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -306034417, now seen corresponding path program 1 times [2025-02-06 03:15:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117452818] [2025-02-06 03:15:41,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:41,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:42,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:42,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:42,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117452818] [2025-02-06 03:15:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117452818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605149070] [2025-02-06 03:15:42,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:42,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:42,144 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:42,155 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2025-02-06 03:15:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:42,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:42,156 INFO L225 Difference]: With dead ends: 187 [2025-02-06 03:15:42,157 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:15:42,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:42,158 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:42,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:15:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:15:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-02-06 03:15:42,167 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 103 [2025-02-06 03:15:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:42,168 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-02-06 03:15:42,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2025-02-06 03:15:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:42,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:42,169 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:42,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:15:42,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:42,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1908324362, now seen corresponding path program 1 times [2025-02-06 03:15:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251526292] [2025-02-06 03:15:42,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:42,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:42,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:42,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:42,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251526292] [2025-02-06 03:15:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251526292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:42,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016595523] [2025-02-06 03:15:42,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:42,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:42,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:42,469 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:42,500 INFO L93 Difference]: Finished difference Result 185 states and 255 transitions. [2025-02-06 03:15:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:42,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:42,502 INFO L225 Difference]: With dead ends: 185 [2025-02-06 03:15:42,503 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:15:42,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:42,504 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:42,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:15:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:15:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2025-02-06 03:15:42,515 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 103 [2025-02-06 03:15:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:42,516 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2025-02-06 03:15:42,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2025-02-06 03:15:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:42,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:42,517 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:15:42,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:42,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -168884981, now seen corresponding path program 1 times [2025-02-06 03:15:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:42,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503470568] [2025-02-06 03:15:42,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:42,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:42,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:42,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:42,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:42,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503470568] [2025-02-06 03:15:42,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503470568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:42,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:42,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351837042] [2025-02-06 03:15:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:42,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:42,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:42,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:42,896 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:42,928 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2025-02-06 03:15:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:42,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:42,930 INFO L225 Difference]: With dead ends: 185 [2025-02-06 03:15:42,930 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:15:42,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:42,931 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:42,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:15:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:15:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2025-02-06 03:15:42,938 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 103 [2025-02-06 03:15:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:42,939 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2025-02-06 03:15:42,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2025-02-06 03:15:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:42,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:42,939 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:42,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:15:42,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -674443606, now seen corresponding path program 1 times [2025-02-06 03:15:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51478627] [2025-02-06 03:15:42,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:42,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:42,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:42,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:42,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51478627] [2025-02-06 03:15:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51478627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:43,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751560183] [2025-02-06 03:15:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:43,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:43,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:43,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:43,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:43,563 INFO L87 Difference]: Start difference. First operand 94 states and 127 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:43,684 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2025-02-06 03:15:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:15:43,685 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:43,686 INFO L225 Difference]: With dead ends: 218 [2025-02-06 03:15:43,686 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:15:43,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:15:43,687 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 99 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:43,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 565 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:15:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-02-06 03:15:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 104 states have internal predecessors, (130), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:15:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 170 transitions. [2025-02-06 03:15:43,699 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 170 transitions. Word has length 103 [2025-02-06 03:15:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:43,699 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 170 transitions. [2025-02-06 03:15:43,700 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 170 transitions. [2025-02-06 03:15:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:43,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:43,701 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:43,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:15:43,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:43,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1823572331, now seen corresponding path program 1 times [2025-02-06 03:15:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:43,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848813542] [2025-02-06 03:15:43,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:43,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:43,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:43,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:43,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:15:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:44,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848813542] [2025-02-06 03:15:44,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848813542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:44,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505593942] [2025-02-06 03:15:44,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:15:44,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:15:44,199 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:15:44,200 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:15:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:44,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:44,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:15:44,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:44,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:15:44,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:15:44,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:15:44,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:15:44,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2025-02-06 03:15:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 03:15:44,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:15:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505593942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:15:44,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:15:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-02-06 03:15:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51068964] [2025-02-06 03:15:44,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:15:44,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:15:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:44,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:15:44,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:15:44,802 INFO L87 Difference]: Start difference. First operand 126 states and 170 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-06 03:15:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:44,998 INFO L93 Difference]: Finished difference Result 239 states and 313 transitions. [2025-02-06 03:15:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:15:44,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 103 [2025-02-06 03:15:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:45,001 INFO L225 Difference]: With dead ends: 239 [2025-02-06 03:15:45,001 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:15:45,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:15:45,001 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 211 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:45,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 399 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:15:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-02-06 03:15:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.238532110091743) internal successors, (135), 110 states have internal predecessors, (135), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:15:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 175 transitions. [2025-02-06 03:15:45,013 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 175 transitions. Word has length 103 [2025-02-06 03:15:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:45,014 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 175 transitions. [2025-02-06 03:15:45,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-06 03:15:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 175 transitions. [2025-02-06 03:15:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:45,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:45,015 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:45,022 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:15:45,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:15:45,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 397630166, now seen corresponding path program 1 times [2025-02-06 03:15:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:45,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655164545] [2025-02-06 03:15:45,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:45,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:45,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:45,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:45,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:15:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655164545] [2025-02-06 03:15:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655164545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:15:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911432119] [2025-02-06 03:15:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:45,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:15:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:15:45,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:15:45,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:15:45,702 INFO L87 Difference]: Start difference. First operand 134 states and 175 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:45,816 INFO L93 Difference]: Finished difference Result 248 states and 320 transitions. [2025-02-06 03:15:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:15:45,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:45,817 INFO L225 Difference]: With dead ends: 248 [2025-02-06 03:15:45,818 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 03:15:45,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:15:45,818 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 110 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1159 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:15:45,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1159 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 03:15:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2025-02-06 03:15:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 113 states have internal predecessors, (136), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:15:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 180 transitions. [2025-02-06 03:15:45,831 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 180 transitions. Word has length 103 [2025-02-06 03:15:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 180 transitions. [2025-02-06 03:15:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 180 transitions. [2025-02-06 03:15:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:15:45,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:45,833 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:45,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:15:45,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1589438061, now seen corresponding path program 1 times [2025-02-06 03:15:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:15:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528414630] [2025-02-06 03:15:45,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:15:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:15:45,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:15:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:15:45,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:15:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:15:46,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:15:46,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:46,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:15:46,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:15:46,040 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:15:46,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:15:46,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:15:46,044 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:46,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:15:46,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:15:46 BoogieIcfgContainer [2025-02-06 03:15:46,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:15:46,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:15:46,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:15:46,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:15:46,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:40" (3/4) ... [2025-02-06 03:15:46,117 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:15:46,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:15:46,118 INFO L158 Benchmark]: Toolchain (without parser) took 6917.43ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.4MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2025-02-06 03:15:46,118 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:15:46,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.32ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:15:46,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.29ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 103.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:15:46,119 INFO L158 Benchmark]: Boogie Preprocessor took 48.94ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 99.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:15:46,119 INFO L158 Benchmark]: IcfgBuilder took 591.96ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 67.4MB in the end (delta: 32.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:15:46,119 INFO L158 Benchmark]: TraceAbstraction took 5978.31ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 66.9MB in the beginning and 120.0MB in the end (delta: -53.1MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2025-02-06 03:15:46,120 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 243.3MB. Free memory was 120.0MB in the beginning and 119.9MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:15:46,120 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.40ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.32ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.29ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 103.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.94ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 99.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 591.96ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 67.4MB in the end (delta: 32.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5978.31ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 66.9MB in the beginning and 120.0MB in the end (delta: -53.1MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 243.3MB. Free memory was 120.0MB in the beginning and 119.9MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 38, overapproximation of someBinaryFLOATComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET updateVariables() [L92] CALL step() [L37] EXPR unsigned_char_Array_0[0] [L37] unsigned_char_Array_0[1] = (unsigned_char_Array_0[0] + 100) [L38] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L38] EXPR float_Array_0[1] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] float_Array_0[0] = ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))) [L39] EXPR unsigned_char_Array_0[1] [L39] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] signed_long_int_Array_0[0] = (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))) [L44] EXPR float_Array_0[1] [L44] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L44] COND TRUE float_Array_0[1] <= float_Array_0[0] [L45] EXPR signed_long_int_Array_0[0] [L45] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L45] COND TRUE signed_long_int_Array_0[0] != unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1][2] [L46] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][2] [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((- float_Array_0[0]) > float_Array_0[1]) [L58] EXPR signed_long_int_Array_0[0] [L58] EXPR unsigned_char_Array_0[0] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] [L58] EXPR BOOL_unsigned_char_Array_0[0][1] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] BOOL_unsigned_char_Array_0[0][0] = ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]) [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) [L83] EXPR signed_long_int_Array_0[0] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[0] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L83] EXPR float_Array_0[1] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83-L84] return (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 4327 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3028 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 553 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 1299 mSDtfsCounter, 553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 330 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=10, InterpolantAutomatonStates: 54, 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, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 3296 SizeOfPredicates, 5 NumberOfNonLiveVariables, 765 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2759/2860 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:15:46,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.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 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:15:47,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:15:48,001 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:15:48,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:15:48,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:15:48,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:15:48,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:15:48,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:15:48,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:15:48,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:15:48,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:15:48,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:15:48,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:15:48,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:15:48,032 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:15:48,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:15:48,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:15:48,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:15:48,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:15:48,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:15:48,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:15:48,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:15:48,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:15:48,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:15:48,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:15:48,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:15:48,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:15:48,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:15:48,035 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 -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2025-02-06 03:15:48,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:15:48,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:15:48,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:15:48,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:15:48,293 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:15:48,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-02-06 03:15:49,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e299b62c/d6b567e6e5434e2a925f622a1c31ba47/FLAG3e8cb7812 [2025-02-06 03:15:49,701 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:15:49,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-02-06 03:15:49,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e299b62c/d6b567e6e5434e2a925f622a1c31ba47/FLAG3e8cb7812 [2025-02-06 03:15:49,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e299b62c/d6b567e6e5434e2a925f622a1c31ba47 [2025-02-06 03:15:49,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:15:49,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:15:49,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:15:49,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:15:49,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:15:49,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:15:49" (1/1) ... [2025-02-06 03:15:49,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2353d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:49, skipping insertion in model container [2025-02-06 03:15:49,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:15:49" (1/1) ... [2025-02-06 03:15:49,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:15:49,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-02-06 03:15:49,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:15:49,934 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:15:49,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-02-06 03:15:49,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:15:50,002 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:15:50,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50 WrapperNode [2025-02-06 03:15:50,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:15:50,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:15:50,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:15:50,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:15:50,009 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:15:50" (1/1) ... [2025-02-06 03:15:50,023 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:15:50" (1/1) ... [2025-02-06 03:15:50,057 INFO L138 Inliner]: procedures = 33, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-02-06 03:15:50,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:15:50,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:15:50,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:15:50,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:15:50,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,100 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2025-02-06 03:15:50,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:15:50,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:15:50,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:15:50,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:15:50,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (1/1) ... [2025-02-06 03:15:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:15:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:15:50,173 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:15:50,175 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:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:15:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:15:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:15:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:15:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:15:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:15:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:15:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:15:50,328 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:15:50,330 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:15:50,829 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-02-06 03:15:50,868 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-02-06 03:15:50,868 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:15:50,875 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:15:50,876 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:15:50,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:50 BoogieIcfgContainer [2025-02-06 03:15:50,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:15:50,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:15:50,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:15:50,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:15:50,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:15:49" (1/3) ... [2025-02-06 03:15:50,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd7904a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:15:50, skipping insertion in model container [2025-02-06 03:15:50,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:15:50" (2/3) ... [2025-02-06 03:15:50,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd7904a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:15:50, skipping insertion in model container [2025-02-06 03:15:50,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:15:50" (3/3) ... [2025-02-06 03:15:50,885 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2025-02-06 03:15:50,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:15:50,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:15:50,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:15:50,954 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;@5071525a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:15:50,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:15:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:50,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:50,965 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:50,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:50,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:50,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1254385902, now seen corresponding path program 1 times [2025-02-06 03:15:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:50,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505058638] [2025-02-06 03:15:50,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:50,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:50,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:50,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:15:51,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:51,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:51,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:15:51,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:15:51,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:51,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505058638] [2025-02-06 03:15:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505058638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:51,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:51,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:15:51,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605725065] [2025-02-06 03:15:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:51,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:15:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:51,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:15:51,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:15:51,253 INFO L87 Difference]: Start difference. First operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:51,276 INFO L93 Difference]: Finished difference Result 192 states and 290 transitions. [2025-02-06 03:15:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:15:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:51,283 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:15:51,284 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:15:51,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:15:51,289 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:51,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:15:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 03:15:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-02-06 03:15:51,320 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2025-02-06 03:15:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:51,320 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-02-06 03:15:51,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-02-06 03:15:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:51,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:51,323 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:51,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:15:51,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:51,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:51,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1303725911, now seen corresponding path program 1 times [2025-02-06 03:15:51,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:51,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288622078] [2025-02-06 03:15:51,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:51,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:51,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:51,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:15:51,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:51,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:51,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:51,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:51,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:51,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:15:51,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:51,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288622078] [2025-02-06 03:15:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288622078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:51,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554097641] [2025-02-06 03:15:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:51,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:51,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:51,731 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:51,762 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2025-02-06 03:15:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:15:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:51,764 INFO L225 Difference]: With dead ends: 191 [2025-02-06 03:15:51,764 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:15:51,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:51,765 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:51,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:15:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:15:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-02-06 03:15:51,775 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103 [2025-02-06 03:15:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:51,777 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-02-06 03:15:51,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-02-06 03:15:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:51,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:51,781 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:51,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:15:51,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:51,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1063185782, now seen corresponding path program 1 times [2025-02-06 03:15:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694613901] [2025-02-06 03:15:51,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:51,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:51,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:15:52,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:52,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:52,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:52,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:52,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:52,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694613901] [2025-02-06 03:15:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694613901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:52,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319719568] [2025-02-06 03:15:52,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:52,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:52,217 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:52,240 INFO L93 Difference]: Finished difference Result 191 states and 268 transitions. [2025-02-06 03:15:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:52,241 INFO L225 Difference]: With dead ends: 191 [2025-02-06 03:15:52,241 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:15:52,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:52,242 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:52,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:15:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 03:15:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2025-02-06 03:15:52,250 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 103 [2025-02-06 03:15:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:52,251 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2025-02-06 03:15:52,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2025-02-06 03:15:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:52,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:52,254 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:52,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:15:52,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:52,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:52,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash -926036346, now seen corresponding path program 1 times [2025-02-06 03:15:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854520901] [2025-02-06 03:15:52,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:52,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:52,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:52,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:52,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:15:52,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:52,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:15:52,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:52,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-02-06 03:15:52,799 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 30 treesize of output 26 [2025-02-06 03:15:52,931 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 34 treesize of output 26 [2025-02-06 03:15:52,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:52,977 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 62 treesize of output 30 [2025-02-06 03:15:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:15:53,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:53,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:53,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854520901] [2025-02-06 03:15:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854520901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:53,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:53,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:15:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991698831] [2025-02-06 03:15:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:53,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:15:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:53,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:15:53,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:15:53,062 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:53,914 INFO L93 Difference]: Finished difference Result 233 states and 318 transitions. [2025-02-06 03:15:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:15:53,914 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:15:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:53,915 INFO L225 Difference]: With dead ends: 233 [2025-02-06 03:15:53,915 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:15:53,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:15:53,917 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 142 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:53,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1021 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:15:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:15:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2025-02-06 03:15:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 138 transitions. [2025-02-06 03:15:53,927 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 138 transitions. Word has length 103 [2025-02-06 03:15:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 138 transitions. [2025-02-06 03:15:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 138 transitions. [2025-02-06 03:15:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:53,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:53,928 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:53,934 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:15:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:54,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:54,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1571979591, now seen corresponding path program 1 times [2025-02-06 03:15:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314511866] [2025-02-06 03:15:54,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:54,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:54,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:54,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:54,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 (6)] Waiting until timeout for monitored process [2025-02-06 03:15:54,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:54,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:54,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:54,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:54,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:54,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:15:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:54,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:54,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314511866] [2025-02-06 03:15:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314511866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:15:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798219795] [2025-02-06 03:15:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:54,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:15:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:54,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:15:54,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:54,308 INFO L87 Difference]: Start difference. First operand 102 states and 138 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:54,325 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2025-02-06 03:15:54,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:15:54,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:54,326 INFO L225 Difference]: With dead ends: 197 [2025-02-06 03:15:54,326 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:15:54,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:15:54,327 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:54,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:15:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:15:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2025-02-06 03:15:54,340 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 103 [2025-02-06 03:15:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:54,340 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2025-02-06 03:15:54,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2025-02-06 03:15:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:54,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:54,345 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:54,350 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:15:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:54,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1908324362, now seen corresponding path program 1 times [2025-02-06 03:15:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326663976] [2025-02-06 03:15:54,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:54,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:54,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:15:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:54,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:54,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:54,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:54,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:15:54,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:54,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-02-06 03:15:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:15:54,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:54,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326663976] [2025-02-06 03:15:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326663976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:15:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703783475] [2025-02-06 03:15:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:15:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:54,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:15:54,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:15:54,791 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:55,133 INFO L93 Difference]: Finished difference Result 230 states and 309 transitions. [2025-02-06 03:15:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:15:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:15:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:55,135 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:15:55,135 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:15:55,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:15:55,136 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 214 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:55,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 538 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:15:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2025-02-06 03:15:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2025-02-06 03:15:55,148 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 103 [2025-02-06 03:15:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:55,149 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2025-02-06 03:15:55,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2025-02-06 03:15:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:55,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:55,150 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:55,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:15:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:55,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:55,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash -168884981, now seen corresponding path program 1 times [2025-02-06 03:15:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378729016] [2025-02-06 03:15:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:55,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:55,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:15:55,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:55,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:55,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:55,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:55,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:15:55,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:55,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-02-06 03:15:55,604 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 30 treesize of output 26 [2025-02-06 03:15:55,708 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 34 treesize of output 26 [2025-02-06 03:15:55,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:55,769 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 114 treesize of output 52 [2025-02-06 03:15:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:15:55,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:55,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378729016] [2025-02-06 03:15:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378729016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:55,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:15:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374994231] [2025-02-06 03:15:55,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:55,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:15:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:55,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:15:55,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:15:55,773 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:56,285 INFO L93 Difference]: Finished difference Result 230 states and 307 transitions. [2025-02-06 03:15:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:15:56,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:15:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:56,287 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:15:56,287 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:15:56,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:15:56,288 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 130 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:56,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 683 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:15:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:15:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2025-02-06 03:15:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2025-02-06 03:15:56,301 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 103 [2025-02-06 03:15:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:56,302 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2025-02-06 03:15:56,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2025-02-06 03:15:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:56,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:56,302 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:56,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:15:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:56,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -674443606, now seen corresponding path program 1 times [2025-02-06 03:15:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:56,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929130319] [2025-02-06 03:15:56,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:56,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:56,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:56,506 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:56,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:15:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:56,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:56,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:56,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:56,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:15:56,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:56,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:15:56,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-02-06 03:15:56,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:56,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:15:56,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:56,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-02-06 03:15:57,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:57,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2025-02-06 03:15:57,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:57,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2025-02-06 03:15:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-06 03:15:57,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:15:57,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929130319] [2025-02-06 03:15:57,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929130319] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:15:57,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:15:57,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2025-02-06 03:15:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142655069] [2025-02-06 03:15:57,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:15:57,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:15:57,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:57,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:15:57,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:15:57,434 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand has 12 states, 10 states have (on average 8.8) internal successors, (88), 12 states have internal predecessors, (88), 6 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 6 states have call successors, (21) [2025-02-06 03:15:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:57,772 INFO L93 Difference]: Finished difference Result 209 states and 271 transitions. [2025-02-06 03:15:57,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:15:57,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.8) internal successors, (88), 12 states have internal predecessors, (88), 6 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 6 states have call successors, (21) Word has length 103 [2025-02-06 03:15:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:57,773 INFO L225 Difference]: With dead ends: 209 [2025-02-06 03:15:57,773 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:15:57,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:15:57,774 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 212 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:57,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 405 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:15:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2025-02-06 03:15:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:15:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2025-02-06 03:15:57,781 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 103 [2025-02-06 03:15:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:57,781 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 135 transitions. [2025-02-06 03:15:57,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.8) internal successors, (88), 12 states have internal predecessors, (88), 6 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 6 states have call successors, (21) [2025-02-06 03:15:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2025-02-06 03:15:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:57,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:57,782 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:15:57,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:15:57,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:57,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:57,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2100385771, now seen corresponding path program 1 times [2025-02-06 03:15:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416135793] [2025-02-06 03:15:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:15:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:57,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:15:57,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:15:58,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:58,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:58,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:58,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:58,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:15:58,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:58,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2025-02-06 03:15:58,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:58,531 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 154 treesize of output 58 [2025-02-06 03:15:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:15:58,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:16:10,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:16:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416135793] [2025-02-06 03:16:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416135793] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1632561264] [2025-02-06 03:16:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:16:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:16:10,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:16:10,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-02-06 03:16:10,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:16:10,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:16:10,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:10,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:10,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:16:10,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:12,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2025-02-06 03:16:12,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:16:12,995 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 154 treesize of output 58 [2025-02-06 03:16:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:16:13,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:16:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1632561264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:20,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:16:20,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-02-06 03:16:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143856134] [2025-02-06 03:16:20,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:16:20,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:16:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:16:20,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:16:20,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:16:20,958 INFO L87 Difference]: Start difference. First operand 106 states and 135 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:16:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:26,262 INFO L93 Difference]: Finished difference Result 386 states and 492 transitions. [2025-02-06 03:16:26,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:16:26,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:16:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:26,264 INFO L225 Difference]: With dead ends: 386 [2025-02-06 03:16:26,264 INFO L226 Difference]: Without dead ends: 283 [2025-02-06 03:16:26,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:16:26,264 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 355 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:26,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1295 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-06 03:16:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-06 03:16:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2025-02-06 03:16:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 235 states have (on average 1.251063829787234) internal successors, (294), 237 states have internal predecessors, (294), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:16:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 354 transitions. [2025-02-06 03:16:26,289 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 354 transitions. Word has length 103 [2025-02-06 03:16:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:26,289 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 354 transitions. [2025-02-06 03:16:26,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:16:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 354 transitions. [2025-02-06 03:16:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:16:26,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:26,290 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:26,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-02-06 03:16:26,496 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:16:26,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:16:26,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:26,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1939844980, now seen corresponding path program 1 times [2025-02-06 03:16:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:16:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011355056] [2025-02-06 03:16:26,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:26,692 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:16:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:16:26,693 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:16:26,694 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:16:26,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:16:26,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:16:26,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:26,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:26,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:16:26,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:29,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 88 treesize of output 34 [2025-02-06 03:16:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:16:29,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:29,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:16:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011355056] [2025-02-06 03:16:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011355056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:29,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:16:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592787773] [2025-02-06 03:16:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:16:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:16:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:16:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:29,620 INFO L87 Difference]: Start difference. First operand 277 states and 354 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:16:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:32,498 INFO L93 Difference]: Finished difference Result 477 states and 605 transitions. [2025-02-06 03:16:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:16:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-06 03:16:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:32,500 INFO L225 Difference]: With dead ends: 477 [2025-02-06 03:16:32,501 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 03:16:32,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:16:32,501 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 184 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:32,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 585 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 03:16:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 03:16:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2025-02-06 03:16:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 168 states have (on average 1.2321428571428572) internal successors, (207), 169 states have internal predecessors, (207), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:16:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2025-02-06 03:16:32,520 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 103 [2025-02-06 03:16:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:32,521 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2025-02-06 03:16:32,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:16:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2025-02-06 03:16:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:16:32,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:32,523 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:32,530 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:16:32,723 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:16:32,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:32,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1676897738, now seen corresponding path program 1 times [2025-02-06 03:16:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:16:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218509784] [2025-02-06 03:16:32,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:32,725 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:16:32,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:16:32,727 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:16:32,727 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:16:32,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:16:32,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:16:32,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:32,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:32,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:16:32,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:33,981 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 97 treesize of output 43 [2025-02-06 03:16:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:16:34,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:16:35,124 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 25 [2025-02-06 03:16:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:16:35,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:16:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218509784] [2025-02-06 03:16:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218509784] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:16:35,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:16:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-02-06 03:16:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415322944] [2025-02-06 03:16:35,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:16:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:16:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:16:35,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:16:35,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:16:35,377 INFO L87 Difference]: Start difference. First operand 200 states and 251 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-06 03:16:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:37,787 INFO L93 Difference]: Finished difference Result 422 states and 526 transitions. [2025-02-06 03:16:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:16:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 105 [2025-02-06 03:16:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:37,790 INFO L225 Difference]: With dead ends: 422 [2025-02-06 03:16:37,790 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 03:16:37,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:16:37,791 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 111 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:37,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 474 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:16:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 03:16:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2025-02-06 03:16:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 166 states have (on average 1.2228915662650603) internal successors, (203), 167 states have internal predecessors, (203), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:16:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2025-02-06 03:16:37,804 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 105 [2025-02-06 03:16:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:37,804 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2025-02-06 03:16:37,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-06 03:16:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2025-02-06 03:16:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:16:37,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:37,805 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:37,813 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:16:38,006 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:16:38,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1848899543, now seen corresponding path program 1 times [2025-02-06 03:16:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:16:38,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663267683] [2025-02-06 03:16:38,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:38,007 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:16:38,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:16:38,009 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:16:38,010 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:16:38,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:16:38,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:16:38,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:38,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:38,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:16:38,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:38,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:16:38,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-02-06 03:16:39,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:16:39,154 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 78 treesize of output 44 [2025-02-06 03:16:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:16:39,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:39,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:16:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663267683] [2025-02-06 03:16:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663267683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:16:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700732256] [2025-02-06 03:16:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:16:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:16:39,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:16:39,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:16:39,376 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:16:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:42,850 INFO L93 Difference]: Finished difference Result 462 states and 569 transitions. [2025-02-06 03:16:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:16:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-02-06 03:16:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:42,852 INFO L225 Difference]: With dead ends: 462 [2025-02-06 03:16:42,852 INFO L226 Difference]: Without dead ends: 267 [2025-02-06 03:16:42,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:16:42,853 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:42,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 656 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 03:16:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-06 03:16:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 202. [2025-02-06 03:16:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2176470588235293) internal successors, (207), 171 states have internal predecessors, (207), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:16:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2025-02-06 03:16:42,868 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 105 [2025-02-06 03:16:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:42,868 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2025-02-06 03:16:42,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:16:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2025-02-06 03:16:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:16:42,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:42,869 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:42,875 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:16:43,070 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:16:43,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 51948184, now seen corresponding path program 1 times [2025-02-06 03:16:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:16:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84332529] [2025-02-06 03:16:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:43,071 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:16:43,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:16:43,073 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:16:43,073 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:16:43,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:16:43,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:16:43,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:43,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:43,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:16:43,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:43,263 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 30 treesize of output 26 [2025-02-06 03:16:43,448 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 34 treesize of output 26 [2025-02-06 03:16:43,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 45 treesize of output 21 [2025-02-06 03:16:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:16:43,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:43,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:16:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84332529] [2025-02-06 03:16:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84332529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:16:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497317812] [2025-02-06 03:16:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:43,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:16:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:16:43,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:16:43,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:43,846 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:16:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:45,482 INFO L93 Difference]: Finished difference Result 468 states and 574 transitions. [2025-02-06 03:16:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:16:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-02-06 03:16:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:45,484 INFO L225 Difference]: With dead ends: 468 [2025-02-06 03:16:45,484 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 03:16:45,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:16:45,485 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 106 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:45,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 736 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:16:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 03:16:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 198. [2025-02-06 03:16:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:16:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2025-02-06 03:16:45,520 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 105 [2025-02-06 03:16:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:45,521 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2025-02-06 03:16:45,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:16:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2025-02-06 03:16:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:16:45,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:45,521 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:45,526 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:16:45,722 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:16:45,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1217626325, now seen corresponding path program 1 times [2025-02-06 03:16:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:16:45,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055586594] [2025-02-06 03:16:45,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:45,723 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:16:45,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:16:45,725 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:16:45,725 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:16:45,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:16:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:16:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:45,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:16:45,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:46,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:16:49,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2025-02-06 03:16:51,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:16:51,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 152 treesize of output 56 [2025-02-06 03:16:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 98 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 03:16:51,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:16:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:16:54,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:16:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055586594] [2025-02-06 03:16:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055586594] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 21 [2025-02-06 03:16:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682383466] [2025-02-06 03:16:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:54,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:16:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:16:54,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:16:54,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:16:54,139 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:16:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:56,599 INFO L93 Difference]: Finished difference Result 501 states and 622 transitions. [2025-02-06 03:16:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:16:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-02-06 03:16:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:56,601 INFO L225 Difference]: With dead ends: 501 [2025-02-06 03:16:56,601 INFO L226 Difference]: Without dead ends: 306 [2025-02-06 03:16:56,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:16:56,602 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 113 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:56,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 659 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:16:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-06 03:16:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 213. [2025-02-06 03:16:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 181 states have (on average 1.2044198895027625) internal successors, (218), 182 states have internal predecessors, (218), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:16:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 262 transitions. [2025-02-06 03:16:56,622 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 262 transitions. Word has length 107 [2025-02-06 03:16:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:56,622 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 262 transitions. [2025-02-06 03:16:56,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:16:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 262 transitions. [2025-02-06 03:16:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:16:56,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:56,623 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:56,631 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 (16)] Forceful destruction successful, exit code 0 [2025-02-06 03:16:56,823 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:16:56,824 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1021112820, now seen corresponding path program 1 times [2025-02-06 03:16:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:16:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897703698] [2025-02-06 03:16:56,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:56,824 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:16:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:16:56,828 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:16:56,829 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:16:56,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:16:56,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:16:56,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:56,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:56,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:16:56,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:59,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2025-02-06 03:17:01,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:01,455 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 131 treesize of output 47 [2025-02-06 03:17:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:17:01,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:17:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:17:03,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:03,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897703698] [2025-02-06 03:17:03,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897703698] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:03,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:03,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-02-06 03:17:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069557523] [2025-02-06 03:17:03,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:03,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:17:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:03,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:17:03,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:17:03,916 INFO L87 Difference]: Start difference. First operand 213 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:17:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:06,641 INFO L93 Difference]: Finished difference Result 502 states and 617 transitions. [2025-02-06 03:17:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:17:06,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-02-06 03:17:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:06,644 INFO L225 Difference]: With dead ends: 502 [2025-02-06 03:17:06,644 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 03:17:06,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:17:06,645 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 169 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:06,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 677 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 03:17:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 03:17:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 232. [2025-02-06 03:17:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 200 states have (on average 1.205) internal successors, (241), 201 states have internal predecessors, (241), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:17:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 285 transitions. [2025-02-06 03:17:06,660 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 285 transitions. Word has length 107 [2025-02-06 03:17:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:06,660 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 285 transitions. [2025-02-06 03:17:06,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:17:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 285 transitions. [2025-02-06 03:17:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:17:06,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:06,661 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,666 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 (17)] Forceful destruction successful, exit code 0 [2025-02-06 03:17:06,861 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:17:06,861 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash 259418708, now seen corresponding path program 1 times [2025-02-06 03:17:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005563817] [2025-02-06 03:17:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:06,862 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:17:06,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:06,864 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:17:06,865 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:17:06,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:17:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:17:07,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:07,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:17:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:07,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:17:09,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 32 [2025-02-06 03:17:10,499 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 86 treesize of output 32 [2025-02-06 03:17:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:17:10,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:17:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:17:11,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:17:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005563817] [2025-02-06 03:17:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005563817] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:11,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-02-06 03:17:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897288103] [2025-02-06 03:17:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:17:11,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:17:11,890 INFO L87 Difference]: Start difference. First operand 232 states and 285 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:17:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:12,681 INFO L93 Difference]: Finished difference Result 490 states and 599 transitions. [2025-02-06 03:17:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:12,685 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-02-06 03:17:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:12,687 INFO L225 Difference]: With dead ends: 490 [2025-02-06 03:17:12,687 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 03:17:12,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:17:12,687 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 78 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:12,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 460 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:17:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 03:17:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 210. [2025-02-06 03:17:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 178 states have (on average 1.196629213483146) internal successors, (213), 179 states have internal predecessors, (213), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:17:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2025-02-06 03:17:12,705 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 107 [2025-02-06 03:17:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:12,705 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2025-02-06 03:17:12,705 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:17:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2025-02-06 03:17:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:17:12,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:12,706 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:12,713 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:17:12,906 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:17:12,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1228942452, now seen corresponding path program 1 times [2025-02-06 03:17:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:17:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483502069] [2025-02-06 03:17:12,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:12,907 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:17:12,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:17:12,909 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:17:12,911 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:17:12,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:17:13,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:17:13,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:13,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:13,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:17:13,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:13,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:17:16,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 33