./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:25:13,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:25:13,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:25:13,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:25:13,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:25:13,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:25:13,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:25:13,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:25:13,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:25:13,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:25:13,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:25:13,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:25:13,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:25:13,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:25:13,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:25:13,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:25:13,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:25:13,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:25:13,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:25:13,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:13,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:25:13,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:25:13,435 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/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 -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2025-03-17 05:25:13,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:25:13,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:25:13,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:25:13,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:25:13,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:25:13,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2025-03-17 05:25:14,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8815ad95/45da7e9d528c4f2f8da0edaec1f672ba/FLAG04c82c58f [2025-03-17 05:25:15,086 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:25:15,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2025-03-17 05:25:15,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8815ad95/45da7e9d528c4f2f8da0edaec1f672ba/FLAG04c82c58f [2025-03-17 05:25:15,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8815ad95/45da7e9d528c4f2f8da0edaec1f672ba [2025-03-17 05:25:15,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:25:15,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:25:15,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:15,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:25:15,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:25:15,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1daea35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15, skipping insertion in model container [2025-03-17 05:25:15,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:25:15,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2025-03-17 05:25:15,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:15,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:25:15,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2025-03-17 05:25:15,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:15,334 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:25:15,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15 WrapperNode [2025-03-17 05:25:15,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:15,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:15,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:25:15,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:25:15,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,379 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2025-03-17 05:25:15,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:15,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:25:15,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:25:15,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:25:15,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,419 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2025-03-17 05:25:15,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:25:15,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:25:15,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:25:15,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:25:15,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (1/1) ... [2025-03-17 05:25:15,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:15,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:25:15,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:25:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:25:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:25:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:25:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:25:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:25:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:25:15,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:25:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:25:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:25:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:25:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:25:15,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:25:15,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:25:15,608 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:25:15,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1; [2025-03-17 05:25:15,960 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-17 05:25:15,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:25:15,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:25:15,968 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:25:15,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:15 BoogieIcfgContainer [2025-03-17 05:25:15,969 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:25:15,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:25:15,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:25:15,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:25:15,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:25:15" (1/3) ... [2025-03-17 05:25:15,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e850b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:15, skipping insertion in model container [2025-03-17 05:25:15,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:15" (2/3) ... [2025-03-17 05:25:15,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e850b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:15, skipping insertion in model container [2025-03-17 05:25:15,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:15" (3/3) ... [2025-03-17 05:25:15,976 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2025-03-17 05:25:15,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:25:15,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-57.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:25:16,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:25:16,058 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;@713bedf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:25:16,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:25:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:16,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:16,074 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:16,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 250836808, now seen corresponding path program 1 times [2025-03-17 05:25:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013589050] [2025-03-17 05:25:16,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:16,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:16,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:16,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:25:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013589050] [2025-03-17 05:25:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013589050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339316338] [2025-03-17 05:25:16,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:16,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:25:16,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:16,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:25:16,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:25:16,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:16,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:16,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:25:16,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:25:16,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339316338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:16,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:16,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:25:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884888731] [2025-03-17 05:25:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:16,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:25:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:16,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:25:16,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:16,639 INFO L87 Difference]: Start difference. First operand has 91 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:16,658 INFO L93 Difference]: Finished difference Result 179 states and 286 transitions. [2025-03-17 05:25:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:25:16,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-03-17 05:25:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:16,665 INFO L225 Difference]: With dead ends: 179 [2025-03-17 05:25:16,665 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 05:25:16,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-03-17 05:25:16,669 INFO L435 NwaCegarLoop]: 131 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, 131 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-03-17 05:25:16,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 05:25:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 05:25:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-17 05:25:16,709 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 130 [2025-03-17 05:25:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:16,710 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-17 05:25:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-17 05:25:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:16,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:16,716 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:16,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:25:16,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:25:16,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash -487018058, now seen corresponding path program 1 times [2025-03-17 05:25:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:16,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455966936] [2025-03-17 05:25:16,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:16,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:16,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:16,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:16,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455966936] [2025-03-17 05:25:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455966936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:17,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807677079] [2025-03-17 05:25:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:17,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:17,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:17,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:17,213 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:17,257 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2025-03-17 05:25:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-17 05:25:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:17,260 INFO L225 Difference]: With dead ends: 180 [2025-03-17 05:25:17,260 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:25:17,261 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-03-17 05:25:17,261 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:17,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:25:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 05:25:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2025-03-17 05:25:17,279 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 130 [2025-03-17 05:25:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:17,280 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2025-03-17 05:25:17,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2025-03-17 05:25:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:17,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:17,281 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:17,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:25:17,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:17,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -486094537, now seen corresponding path program 1 times [2025-03-17 05:25:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196843175] [2025-03-17 05:25:17,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:17,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:17,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:17,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196843175] [2025-03-17 05:25:17,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196843175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:17,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:17,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015580987] [2025-03-17 05:25:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:17,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:17,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:17,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:17,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:17,715 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:17,826 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-17 05:25:17,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:17,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-17 05:25:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:17,833 INFO L225 Difference]: With dead ends: 230 [2025-03-17 05:25:17,833 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 05:25:17,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:17,835 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:17,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 538 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 05:25:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2025-03-17 05:25:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2025-03-17 05:25:17,844 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 130 [2025-03-17 05:25:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:17,845 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2025-03-17 05:25:17,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2025-03-17 05:25:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:25:17,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:17,849 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:17,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:25:17,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:17,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1247504870, now seen corresponding path program 1 times [2025-03-17 05:25:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520961264] [2025-03-17 05:25:17,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:25:17,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:25:17,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:17,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520961264] [2025-03-17 05:25:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520961264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:17,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:17,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:25:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321532688] [2025-03-17 05:25:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:17,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:25:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:17,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:25:17,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:25:17,952 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:17,981 INFO L93 Difference]: Finished difference Result 253 states and 371 transitions. [2025-03-17 05:25:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:25:17,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2025-03-17 05:25:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:17,983 INFO L225 Difference]: With dead ends: 253 [2025-03-17 05:25:17,983 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 05:25:17,983 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-03-17 05:25:17,985 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 58 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:17,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 294 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 05:25:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 107. [2025-03-17 05:25:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 05:25:17,995 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 132 [2025-03-17 05:25:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:17,996 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 05:25:17,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 05:25:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:25:17,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:17,998 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:17,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:25:17,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1161857627, now seen corresponding path program 1 times [2025-03-17 05:25:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640199630] [2025-03-17 05:25:17,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:25:18,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:25:18,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:18,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:18,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640199630] [2025-03-17 05:25:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640199630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:18,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457710019] [2025-03-17 05:25:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:18,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:18,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:18,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:18,241 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:18,450 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2025-03-17 05:25:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-03-17 05:25:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:18,452 INFO L225 Difference]: With dead ends: 304 [2025-03-17 05:25:18,452 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 05:25:18,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:18,453 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 123 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:18,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 350 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 05:25:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 149. [2025-03-17 05:25:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:25:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 215 transitions. [2025-03-17 05:25:18,476 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 215 transitions. Word has length 133 [2025-03-17 05:25:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:18,476 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 215 transitions. [2025-03-17 05:25:18,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 215 transitions. [2025-03-17 05:25:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:25:18,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:18,478 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:18,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:25:18,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1296418679, now seen corresponding path program 1 times [2025-03-17 05:25:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722556673] [2025-03-17 05:25:18,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:18,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:25:18,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:25:18,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:18,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:18,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722556673] [2025-03-17 05:25:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722556673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:25:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406234247] [2025-03-17 05:25:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:18,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:25:18,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:18,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:25:18,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:25:18,579 INFO L87 Difference]: Start difference. First operand 149 states and 215 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:18,597 INFO L93 Difference]: Finished difference Result 256 states and 372 transitions. [2025-03-17 05:25:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:25:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-17 05:25:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:18,603 INFO L225 Difference]: With dead ends: 256 [2025-03-17 05:25:18,603 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 05:25:18,604 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-03-17 05:25:18,605 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:18,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 05:25:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-17 05:25:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:25:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2025-03-17 05:25:18,625 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 216 transitions. Word has length 137 [2025-03-17 05:25:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:18,626 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 216 transitions. [2025-03-17 05:25:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2025-03-17 05:25:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:25:18,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:18,627 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:18,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:25:18,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:18,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1167335960, now seen corresponding path program 1 times [2025-03-17 05:25:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:18,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281493204] [2025-03-17 05:25:18,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:18,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:25:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:25:18,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:18,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:18,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281493204] [2025-03-17 05:25:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281493204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:18,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:18,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:25:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786007035] [2025-03-17 05:25:18,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:18,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:25:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:18,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:25:18,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:18,985 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:19,124 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2025-03-17 05:25:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:25:19,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-17 05:25:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:19,126 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:25:19,126 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 05:25:19,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:25:19,127 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 167 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:19,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 636 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 05:25:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 148. [2025-03-17 05:25:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 109 states have internal predecessors, (141), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:25:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2025-03-17 05:25:19,152 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 137 [2025-03-17 05:25:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:19,152 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2025-03-17 05:25:19,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2025-03-17 05:25:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:25:19,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:19,156 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:19,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:25:19,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:19,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 19098634, now seen corresponding path program 1 times [2025-03-17 05:25:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:19,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094458528] [2025-03-17 05:25:19,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:19,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:25:19,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:25:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:19,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094458528] [2025-03-17 05:25:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094458528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099917396] [2025-03-17 05:25:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:19,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:19,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:19,607 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:19,714 INFO L93 Difference]: Finished difference Result 311 states and 447 transitions. [2025-03-17 05:25:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-17 05:25:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:19,719 INFO L225 Difference]: With dead ends: 311 [2025-03-17 05:25:19,719 INFO L226 Difference]: Without dead ends: 206 [2025-03-17 05:25:19,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:19,720 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 120 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:19,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 472 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-17 05:25:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2025-03-17 05:25:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 161 states have (on average 1.329192546583851) internal successors, (214), 162 states have internal predecessors, (214), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:25:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2025-03-17 05:25:19,735 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 140 [2025-03-17 05:25:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2025-03-17 05:25:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2025-03-17 05:25:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:25:19,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:19,736 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:19,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:25:19,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:19,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash -977918998, now seen corresponding path program 1 times [2025-03-17 05:25:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:19,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883095159] [2025-03-17 05:25:19,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:19,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:25:19,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:25:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:21,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883095159] [2025-03-17 05:25:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883095159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:21,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:21,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:25:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192053998] [2025-03-17 05:25:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:21,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:25:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:21,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:25:21,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:21,619 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:21,914 INFO L93 Difference]: Finished difference Result 465 states and 657 transitions. [2025-03-17 05:25:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:25:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:21,918 INFO L225 Difference]: With dead ends: 465 [2025-03-17 05:25:21,918 INFO L226 Difference]: Without dead ends: 305 [2025-03-17 05:25:21,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:21,919 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 60 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:21,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 840 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-17 05:25:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2025-03-17 05:25:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 250 states have (on average 1.324) internal successors, (331), 253 states have internal predecessors, (331), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:25:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 423 transitions. [2025-03-17 05:25:21,945 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 423 transitions. Word has length 140 [2025-03-17 05:25:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:21,947 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 423 transitions. [2025-03-17 05:25:21,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 423 transitions. [2025-03-17 05:25:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:21,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:21,949 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:21,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:25:21,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:21,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1811728702, now seen corresponding path program 1 times [2025-03-17 05:25:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:21,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503805968] [2025-03-17 05:25:21,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:21,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:21,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:21,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503805968] [2025-03-17 05:25:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503805968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564135087] [2025-03-17 05:25:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:22,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:22,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:22,133 INFO L87 Difference]: Start difference. First operand 302 states and 423 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:22,221 INFO L93 Difference]: Finished difference Result 650 states and 909 transitions. [2025-03-17 05:25:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:22,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:22,224 INFO L225 Difference]: With dead ends: 650 [2025-03-17 05:25:22,224 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 05:25:22,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:22,225 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 78 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:22,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 519 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 05:25:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 312. [2025-03-17 05:25:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 260 states have (on average 1.3269230769230769) internal successors, (345), 263 states have internal predecessors, (345), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:25:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 437 transitions. [2025-03-17 05:25:22,256 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 437 transitions. Word has length 141 [2025-03-17 05:25:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:22,257 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 437 transitions. [2025-03-17 05:25:22,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 437 transitions. [2025-03-17 05:25:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:22,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:22,258 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:22,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:25:22,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:22,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash -121609373, now seen corresponding path program 1 times [2025-03-17 05:25:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:22,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581023266] [2025-03-17 05:25:22,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:22,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:22,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:22,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:22,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581023266] [2025-03-17 05:25:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581023266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498863622] [2025-03-17 05:25:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:22,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:22,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:22,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:22,668 INFO L87 Difference]: Start difference. First operand 312 states and 437 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:22,785 INFO L93 Difference]: Finished difference Result 683 states and 948 transitions. [2025-03-17 05:25:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:22,788 INFO L225 Difference]: With dead ends: 683 [2025-03-17 05:25:22,788 INFO L226 Difference]: Without dead ends: 414 [2025-03-17 05:25:22,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:22,789 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 57 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:22,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 578 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-17 05:25:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 274. [2025-03-17 05:25:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 226 states have internal predecessors, (297), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:25:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 385 transitions. [2025-03-17 05:25:22,816 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 385 transitions. Word has length 141 [2025-03-17 05:25:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 385 transitions. [2025-03-17 05:25:22,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 385 transitions. [2025-03-17 05:25:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:22,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:22,818 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:22,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:25:22,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1118627005, now seen corresponding path program 1 times [2025-03-17 05:25:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337864822] [2025-03-17 05:25:22,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:22,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:22,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:22,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:23,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337864822] [2025-03-17 05:25:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337864822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:23,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128125062] [2025-03-17 05:25:23,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:23,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:23,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:23,141 INFO L87 Difference]: Start difference. First operand 274 states and 385 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:23,276 INFO L93 Difference]: Finished difference Result 616 states and 857 transitions. [2025-03-17 05:25:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:23,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 141 [2025-03-17 05:25:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:23,279 INFO L225 Difference]: With dead ends: 616 [2025-03-17 05:25:23,279 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 05:25:23,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:23,281 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 127 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:23,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 454 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 05:25:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 380. [2025-03-17 05:25:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 321 states have (on average 1.3146417445482865) internal successors, (422), 325 states have internal predecessors, (422), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:25:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2025-03-17 05:25:23,320 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 141 [2025-03-17 05:25:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:23,321 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2025-03-17 05:25:23,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2025-03-17 05:25:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:23,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:23,323 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:23,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:25:23,323 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:23,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1107310878, now seen corresponding path program 1 times [2025-03-17 05:25:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:23,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624029330] [2025-03-17 05:25:23,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:23,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:23,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:23,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:23,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:23,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:23,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624029330] [2025-03-17 05:25:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624029330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582055710] [2025-03-17 05:25:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:23,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:23,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:23,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:23,633 INFO L87 Difference]: Start difference. First operand 380 states and 522 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:23,781 INFO L93 Difference]: Finished difference Result 852 states and 1164 transitions. [2025-03-17 05:25:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:23,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 141 [2025-03-17 05:25:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:23,785 INFO L225 Difference]: With dead ends: 852 [2025-03-17 05:25:23,785 INFO L226 Difference]: Without dead ends: 519 [2025-03-17 05:25:23,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:23,786 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 126 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:23,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 603 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-17 05:25:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 428. [2025-03-17 05:25:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 363 states have (on average 1.3112947658402203) internal successors, (476), 368 states have internal predecessors, (476), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:25:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 584 transitions. [2025-03-17 05:25:23,818 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 584 transitions. Word has length 141 [2025-03-17 05:25:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:23,818 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 584 transitions. [2025-03-17 05:25:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 584 transitions. [2025-03-17 05:25:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:23,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:23,820 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:25:23,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:23,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2104383231, now seen corresponding path program 1 times [2025-03-17 05:25:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318599090] [2025-03-17 05:25:23,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:23,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:23,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:23,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318599090] [2025-03-17 05:25:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318599090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281345896] [2025-03-17 05:25:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:24,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:24,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:24,172 INFO L87 Difference]: Start difference. First operand 428 states and 584 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:24,312 INFO L93 Difference]: Finished difference Result 900 states and 1226 transitions. [2025-03-17 05:25:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:24,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 141 [2025-03-17 05:25:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:24,315 INFO L225 Difference]: With dead ends: 900 [2025-03-17 05:25:24,316 INFO L226 Difference]: Without dead ends: 519 [2025-03-17 05:25:24,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:24,317 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 112 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:24,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 606 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-17 05:25:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 445. [2025-03-17 05:25:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 380 states have (on average 1.3078947368421052) internal successors, (497), 385 states have internal predecessors, (497), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:25:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 605 transitions. [2025-03-17 05:25:24,345 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 605 transitions. Word has length 141 [2025-03-17 05:25:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:24,345 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 605 transitions. [2025-03-17 05:25:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 605 transitions. [2025-03-17 05:25:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:24,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:24,347 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:24,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:25:24,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash 393632706, now seen corresponding path program 1 times [2025-03-17 05:25:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587648737] [2025-03-17 05:25:24,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:24,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:24,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:24,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:24,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587648737] [2025-03-17 05:25:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587648737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:24,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:24,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528977161] [2025-03-17 05:25:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:24,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:24,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:24,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:24,553 INFO L87 Difference]: Start difference. First operand 445 states and 605 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:24,642 INFO L93 Difference]: Finished difference Result 890 states and 1206 transitions. [2025-03-17 05:25:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:24,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:24,645 INFO L225 Difference]: With dead ends: 890 [2025-03-17 05:25:24,645 INFO L226 Difference]: Without dead ends: 492 [2025-03-17 05:25:24,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:24,646 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 50 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:24,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 458 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-17 05:25:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 455. [2025-03-17 05:25:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 395 states have internal predecessors, (504), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:25:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 612 transitions. [2025-03-17 05:25:24,673 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 612 transitions. Word has length 141 [2025-03-17 05:25:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 612 transitions. [2025-03-17 05:25:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 612 transitions. [2025-03-17 05:25:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:24,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:24,675 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:24,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:25:24,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1452672157, now seen corresponding path program 1 times [2025-03-17 05:25:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:24,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889601805] [2025-03-17 05:25:24,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:24,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:25:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889601805] [2025-03-17 05:25:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889601805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537652655] [2025-03-17 05:25:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:24,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:25:24,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:24,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:25:24,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:25:24,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:24,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:24,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:24,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:25,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:25:25,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:25,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537652655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:25,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:25,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:25:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785959315] [2025-03-17 05:25:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:25,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:25,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:25,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:25,050 INFO L87 Difference]: Start difference. First operand 455 states and 612 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:25,100 INFO L93 Difference]: Finished difference Result 887 states and 1191 transitions. [2025-03-17 05:25:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:25:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:25,103 INFO L225 Difference]: With dead ends: 887 [2025-03-17 05:25:25,103 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 05:25:25,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:25,105 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:25,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 05:25:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 467. [2025-03-17 05:25:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 402 states have (on average 1.2835820895522387) internal successors, (516), 407 states have internal predecessors, (516), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:25:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2025-03-17 05:25:25,136 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 143 [2025-03-17 05:25:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:25,136 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2025-03-17 05:25:25,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2025-03-17 05:25:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:25,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:25,137 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:25,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:25:25,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 05:25:25,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 373549282, now seen corresponding path program 1 times [2025-03-17 05:25:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97279957] [2025-03-17 05:25:25,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:25,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:25,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:25,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:25,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:25:25,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:25:25,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:25,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:25,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:25,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:25:25,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:25:25,556 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:25:25,558 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:25:25,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:25:25,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:25,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:25:25,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:25:25 BoogieIcfgContainer [2025-03-17 05:25:25,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:25:25,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:25:25,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:25:25,632 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:25:25,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:15" (3/4) ... [2025-03-17 05:25:25,634 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:25:25,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:25:25,636 INFO L158 Benchmark]: Toolchain (without parser) took 10526.98ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 122.8MB in the beginning and 312.8MB in the end (delta: -189.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-03-17 05:25:25,636 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:25,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.91ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 107.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:25:25,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.45ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 104.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:25,637 INFO L158 Benchmark]: Boogie Preprocessor took 58.56ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.5MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:25:25,637 INFO L158 Benchmark]: IcfgBuilder took 529.91ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 71.2MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:25:25,637 INFO L158 Benchmark]: TraceAbstraction took 9661.22ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 70.4MB in the beginning and 312.8MB in the end (delta: -242.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:25,638 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 402.7MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:25,639 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.16ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.91ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 107.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.45ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 104.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.56ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.5MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 529.91ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 71.2MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9661.22ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 70.4MB in the beginning and 312.8MB in the end (delta: -242.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 402.7MB. Free memory is still 312.8MB. 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 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L34] signed char last_1_signed_char_Array_0_1__0__0_ = 64; [L35] signed char last_1_signed_char_Array_0_0__1__1_ = -64; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_char_Array_0[1][0][0] [L96] last_1_signed_char_Array_0_1__0__0_ = signed_char_Array_0[1][0][0] [L97] EXPR signed_char_Array_0[0][1][1] [L97] last_1_signed_char_Array_0_0__1__1_ = signed_char_Array_0[0][1][1] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L76] signed_char_Array_0[0][0][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L79] signed_char_Array_0[0][1][0] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L82] signed_char_Array_0[1][1][0] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L85] signed_char_Array_0[0][0][1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L88] signed_char_Array_0[1][0][1] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L91] signed_char_Array_0[1][1][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L40] COND TRUE ! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_) [L41] EXPR BOOL_unsigned_char_Array_0[2] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-255] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] [L41] EXPR BOOL_unsigned_char_Array_0[1] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-255] [L41] COND TRUE (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && stepLocal_0 [L42] signed_long_int_Array_0[0] = ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR signed_char_Array_0[1][1][1] [L49] EXPR signed_char_Array_0[1][0][1] [L49] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] signed long int stepLocal_3 = (signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))); [L50] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L50] COND TRUE signed_char_Array_0[0][0][0] < stepLocal_3 [L51] EXPR signed_char_Array_0[1][0][1] [L51] EXPR signed_char_Array_0[0][1][0] [L51] signed_char_Array_0[0][1][1] = ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]) [L55] float_Array_0[0] = 128.91f [L56] EXPR signed_char_Array_0[0][1][1] [L56] EXPR signed_long_int_Array_0[0] [L56] unsigned char stepLocal_2 = signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0]; [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_2=0] [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] [L58] EXPR BOOL_unsigned_char_Array_0[2] [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_2=0] [L58] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[2]) [L63] EXPR signed_char_Array_0[0][0][0] [L63] EXPR signed_char_Array_0[0][1][0] [L63] signed_char_Array_0[1][0][0] = (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] [L100] EXPR BOOL_unsigned_char_Array_0[0] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR signed_long_int_Array_0[0] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) [L100] EXPR BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) [L100] EXPR signed_char_Array_0[1][0][0] [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[1][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) [L100] EXPR signed_char_Array_0[0][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) [L100] EXPR float_Array_0[0] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100-L101] return ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 153 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1139 mSDsluCounter, 7727 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5512 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1171 IncrementalHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 2215 mSDtfsCounter, 1171 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=467occurred in iteration=16, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 595 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2614 NumberOfCodeBlocks, 2614 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2453 ConstructedInterpolants, 0 QuantifiedInterpolants, 5193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 959 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 10931/11016 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-03-17 05:25:25,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:25:27,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:25:27,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:25:27,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:25:27,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:25:27,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:25:27,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:25:27,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:25:27,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:25:27,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:25:27,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:25:27,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:25:27,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:25:27,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:25:27,694 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:25:27,696 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:25:27,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:25:27,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:25:27,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:25:27,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:25:27,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:27,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:25:27,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:25:27,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:25:27,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:25:27,698 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/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 -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2025-03-17 05:25:27,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:25:27,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:25:27,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:25:27,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:25:27,941 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:25:27,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2025-03-17 05:25:29,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad384dc6d/17551d3254654a778f20b76500f52eec/FLAGd1c38a780 [2025-03-17 05:25:29,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:25:29,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2025-03-17 05:25:29,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad384dc6d/17551d3254654a778f20b76500f52eec/FLAGd1c38a780 [2025-03-17 05:25:29,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad384dc6d/17551d3254654a778f20b76500f52eec [2025-03-17 05:25:29,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:25:29,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:25:29,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:29,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:25:29,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:25:29,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5ce97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29, skipping insertion in model container [2025-03-17 05:25:29,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:25:29,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2025-03-17 05:25:29,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:29,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:25:29,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2025-03-17 05:25:29,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:29,636 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:25:29,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29 WrapperNode [2025-03-17 05:25:29,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:29,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:29,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:25:29,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:25:29,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,680 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-03-17 05:25:29,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:29,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:25:29,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:25:29,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:25:29,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,716 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2025-03-17 05:25:29,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:25:29,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:25:29,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:25:29,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:25:29,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (1/1) ... [2025-03-17 05:25:29,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:29,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:25:29,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:25:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:25:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:25:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:25:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:25:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:25:29,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:25:29,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:25:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:25:29,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:25:29,934 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:25:30,282 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1; [2025-03-17 05:25:30,317 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-17 05:25:30,317 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:25:30,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:25:30,328 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:25:30,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:30 BoogieIcfgContainer [2025-03-17 05:25:30,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:25:30,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:25:30,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:25:30,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:25:30,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:25:29" (1/3) ... [2025-03-17 05:25:30,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c11f57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:30, skipping insertion in model container [2025-03-17 05:25:30,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:29" (2/3) ... [2025-03-17 05:25:30,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c11f57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:30, skipping insertion in model container [2025-03-17 05:25:30,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:30" (3/3) ... [2025-03-17 05:25:30,339 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2025-03-17 05:25:30,349 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:25:30,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-57.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:25:30,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:25:30,400 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;@64eb886e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:25:30,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:25:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:30,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:30,412 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:30,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:30,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 250836808, now seen corresponding path program 1 times [2025-03-17 05:25:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:30,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034362709] [2025-03-17 05:25:30,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:30,424 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-03-17 05:25:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:30,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:30,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:30,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:30,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:30,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:25:30,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-17 05:25:30,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:30,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034362709] [2025-03-17 05:25:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034362709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:25:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873834729] [2025-03-17 05:25:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:30,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:25:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:30,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:25:30,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:30,717 INFO L87 Difference]: Start difference. First operand has 91 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:30,740 INFO L93 Difference]: Finished difference Result 179 states and 286 transitions. [2025-03-17 05:25:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:25:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-03-17 05:25:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:30,749 INFO L225 Difference]: With dead ends: 179 [2025-03-17 05:25:30,749 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 05:25:30,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-03-17 05:25:30,756 INFO L435 NwaCegarLoop]: 131 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, 131 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-03-17 05:25:30,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 05:25:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 05:25:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:25:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-17 05:25:30,784 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 130 [2025-03-17 05:25:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:30,785 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-17 05:25:30,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-17 05:25:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:30,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:30,787 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:30,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:30,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:30,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -487018058, now seen corresponding path program 1 times [2025-03-17 05:25:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986948358] [2025-03-17 05:25:30,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:30,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:30,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:30,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:31,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:31,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:31,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:31,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:31,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:25:31,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:31,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:31,250 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 41 treesize of output 17 [2025-03-17 05:25:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:31,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:31,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986948358] [2025-03-17 05:25:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986948358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:31,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:25:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542321746] [2025-03-17 05:25:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:31,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:31,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:31,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:31,739 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:32,038 INFO L93 Difference]: Finished difference Result 266 states and 392 transitions. [2025-03-17 05:25:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-17 05:25:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:32,041 INFO L225 Difference]: With dead ends: 266 [2025-03-17 05:25:32,042 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 05:25:32,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:32,044 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 98 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:32,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 314 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 05:25:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2025-03-17 05:25:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:25:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2025-03-17 05:25:32,081 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 130 [2025-03-17 05:25:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:32,082 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2025-03-17 05:25:32,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2025-03-17 05:25:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:25:32,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:32,086 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:32,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:32,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:32,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:32,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1297342200, now seen corresponding path program 1 times [2025-03-17 05:25:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:32,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942897819] [2025-03-17 05:25:32,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:32,288 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-03-17 05:25:32,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:32,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:32,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:32,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:25:32,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:25:32,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:32,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:32,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:25:32,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:32,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:32,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942897819] [2025-03-17 05:25:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942897819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69796014] [2025-03-17 05:25:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:32,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:32,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:32,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:32,535 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:32,693 INFO L93 Difference]: Finished difference Result 306 states and 449 transitions. [2025-03-17 05:25:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-17 05:25:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:32,696 INFO L225 Difference]: With dead ends: 306 [2025-03-17 05:25:32,696 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 05:25:32,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:32,699 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:32,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 593 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 05:25:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-03-17 05:25:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 174 states have internal predecessors, (239), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:25:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 315 transitions. [2025-03-17 05:25:32,731 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 315 transitions. Word has length 137 [2025-03-17 05:25:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:32,732 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 315 transitions. [2025-03-17 05:25:32,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 315 transitions. [2025-03-17 05:25:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:25:32,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:32,733 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:32,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:32,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:32,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:32,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1003939193, now seen corresponding path program 1 times [2025-03-17 05:25:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255353505] [2025-03-17 05:25:32,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:32,939 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-03-17 05:25:32,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:32,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:32,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:33,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:25:33,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:25:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:33,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:33,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:25:33,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:33,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:33,109 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 41 treesize of output 17 [2025-03-17 05:25:33,477 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 45 treesize of output 32 [2025-03-17 05:25:33,479 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 05:25:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2025-03-17 05:25:33,619 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 91 treesize of output 79 [2025-03-17 05:25:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:33,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:33,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:33,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255353505] [2025-03-17 05:25:33,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255353505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:25:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845043491] [2025-03-17 05:25:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:33,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:25:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:33,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:25:33,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:33,650 INFO L87 Difference]: Start difference. First operand 215 states and 315 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:34,085 INFO L93 Difference]: Finished difference Result 418 states and 612 transitions. [2025-03-17 05:25:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:34,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-17 05:25:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:34,088 INFO L225 Difference]: With dead ends: 418 [2025-03-17 05:25:34,088 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 05:25:34,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:25:34,090 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 134 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:34,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 605 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 05:25:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 231. [2025-03-17 05:25:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 189 states have (on average 1.3756613756613756) internal successors, (260), 190 states have internal predecessors, (260), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:25:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2025-03-17 05:25:34,105 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 137 [2025-03-17 05:25:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2025-03-17 05:25:34,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2025-03-17 05:25:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:25:34,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:34,107 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:34,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:25:34,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:34,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -978842519, now seen corresponding path program 1 times [2025-03-17 05:25:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961648862] [2025-03-17 05:25:34,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:34,309 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-03-17 05:25:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:34,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:34,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:34,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:25:34,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:25:34,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:34,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:34,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:25:34,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:34,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:34,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961648862] [2025-03-17 05:25:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961648862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:34,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291844566] [2025-03-17 05:25:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:34,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:34,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:34,472 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:34,496 INFO L93 Difference]: Finished difference Result 378 states and 551 transitions. [2025-03-17 05:25:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-17 05:25:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:34,500 INFO L225 Difference]: With dead ends: 378 [2025-03-17 05:25:34,500 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 05:25:34,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 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-03-17 05:25:34,501 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:34,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 05:25:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2025-03-17 05:25:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 194 states have internal predecessors, (264), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:25:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2025-03-17 05:25:34,527 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 140 [2025-03-17 05:25:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:34,528 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2025-03-17 05:25:34,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2025-03-17 05:25:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:25:34,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:34,530 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:34,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:34,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:34,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:34,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash -977918998, now seen corresponding path program 1 times [2025-03-17 05:25:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:34,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765637435] [2025-03-17 05:25:34,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:34,731 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-03-17 05:25:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:34,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:34,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:34,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:25:34,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:25:34,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:34,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:34,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:25:34,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:34,946 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-03-17 05:25:34,950 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-03-17 05:25:34,953 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-03-17 05:25:34,957 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-03-17 05:25:34,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:25:35,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 05:25:35,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:35,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2025-03-17 05:25:35,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:35,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 71 [2025-03-17 05:25:35,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:35,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 69 [2025-03-17 05:25:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 05:25:35,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:35,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765637435] [2025-03-17 05:25:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765637435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:25:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984900111] [2025-03-17 05:25:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:25:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:35,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:25:35,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:35,331 INFO L87 Difference]: Start difference. First operand 235 states and 340 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:36,092 INFO L93 Difference]: Finished difference Result 640 states and 913 transitions. [2025-03-17 05:25:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:36,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-17 05:25:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:36,095 INFO L225 Difference]: With dead ends: 640 [2025-03-17 05:25:36,095 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 05:25:36,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:36,100 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 268 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:36,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 656 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:25:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 05:25:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 489. [2025-03-17 05:25:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 425 states have (on average 1.3741176470588234) internal successors, (584), 430 states have internal predecessors, (584), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:25:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 696 transitions. [2025-03-17 05:25:36,124 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 696 transitions. Word has length 140 [2025-03-17 05:25:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:36,125 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 696 transitions. [2025-03-17 05:25:36,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:25:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 696 transitions. [2025-03-17 05:25:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:36,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:36,126 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:36,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:36,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:36,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:36,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1811728702, now seen corresponding path program 1 times [2025-03-17 05:25:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822759594] [2025-03-17 05:25:36,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:36,332 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-03-17 05:25:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:36,334 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:36,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:36,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:36,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:36,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:36,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:36,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:25:36,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 05:25:36,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:36,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822759594] [2025-03-17 05:25:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822759594] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:36,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:36,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-17 05:25:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356730683] [2025-03-17 05:25:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:36,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:36,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:36,794 INFO L87 Difference]: Start difference. First operand 489 states and 696 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:36,903 INFO L93 Difference]: Finished difference Result 980 states and 1389 transitions. [2025-03-17 05:25:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:36,907 INFO L225 Difference]: With dead ends: 980 [2025-03-17 05:25:36,907 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 05:25:36,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:36,908 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 70 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:36,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 465 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 05:25:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2025-03-17 05:25:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 505 states have (on average 1.3524752475247526) internal successors, (683), 511 states have internal predecessors, (683), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:25:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 807 transitions. [2025-03-17 05:25:36,941 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 807 transitions. Word has length 141 [2025-03-17 05:25:36,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:36,942 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 807 transitions. [2025-03-17 05:25:36,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 807 transitions. [2025-03-17 05:25:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:36,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:36,943 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:36,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:37,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1984020544, now seen corresponding path program 1 times [2025-03-17 05:25:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154595636] [2025-03-17 05:25:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:37,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:37,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:37,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:37,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:37,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:37,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:25:37,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:37,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:25:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:37,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:37,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:37,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154595636] [2025-03-17 05:25:37,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154595636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:37,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:37,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941862797] [2025-03-17 05:25:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:37,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:37,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:37,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:37,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:37,344 INFO L87 Difference]: Start difference. First operand 577 states and 807 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:37,510 INFO L93 Difference]: Finished difference Result 1215 states and 1711 transitions. [2025-03-17 05:25:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:37,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:37,514 INFO L225 Difference]: With dead ends: 1215 [2025-03-17 05:25:37,515 INFO L226 Difference]: Without dead ends: 783 [2025-03-17 05:25:37,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:37,517 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 80 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:37,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 529 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-17 05:25:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 605. [2025-03-17 05:25:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 533 states have (on average 1.3602251407129455) internal successors, (725), 539 states have internal predecessors, (725), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:25:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 849 transitions. [2025-03-17 05:25:37,577 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 849 transitions. Word has length 141 [2025-03-17 05:25:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:37,577 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 849 transitions. [2025-03-17 05:25:37,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 849 transitions. [2025-03-17 05:25:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:37,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:37,582 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:37,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1617845055, now seen corresponding path program 1 times [2025-03-17 05:25:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615953824] [2025-03-17 05:25:37,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:37,784 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-03-17 05:25:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:37,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:37,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:37,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:25:37,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 05:25:38,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:38,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615953824] [2025-03-17 05:25:38,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615953824] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:38,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-03-17 05:25:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749555775] [2025-03-17 05:25:38,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:38,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:38,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:38,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:38,311 INFO L87 Difference]: Start difference. First operand 605 states and 849 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:38,444 INFO L93 Difference]: Finished difference Result 1205 states and 1694 transitions. [2025-03-17 05:25:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:38,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:38,450 INFO L225 Difference]: With dead ends: 1205 [2025-03-17 05:25:38,450 INFO L226 Difference]: Without dead ends: 763 [2025-03-17 05:25:38,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:25:38,452 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 69 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:38,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 573 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-17 05:25:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 657. [2025-03-17 05:25:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 580 states have (on average 1.3637931034482758) internal successors, (791), 587 states have internal predecessors, (791), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 59 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:25:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 923 transitions. [2025-03-17 05:25:38,488 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 923 transitions. Word has length 141 [2025-03-17 05:25:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:38,488 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 923 transitions. [2025-03-17 05:25:38,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 923 transitions. [2025-03-17 05:25:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:38,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:38,490 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:38,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:38,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:38,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:38,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2104383231, now seen corresponding path program 1 times [2025-03-17 05:25:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547747199] [2025-03-17 05:25:38,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:38,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-03-17 05:25:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:38,696 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:38,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:25:38,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:38,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:38,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:38,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:38,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:25:38,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:38,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:38,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547747199] [2025-03-17 05:25:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547747199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926104473] [2025-03-17 05:25:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:38,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:38,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:38,888 INFO L87 Difference]: Start difference. First operand 657 states and 923 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:39,031 INFO L93 Difference]: Finished difference Result 1310 states and 1839 transitions. [2025-03-17 05:25:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:39,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:39,035 INFO L225 Difference]: With dead ends: 1310 [2025-03-17 05:25:39,035 INFO L226 Difference]: Without dead ends: 807 [2025-03-17 05:25:39,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:39,036 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 72 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:39,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 658 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-03-17 05:25:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 708. [2025-03-17 05:25:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 631 states have (on average 1.3454833597464342) internal successors, (849), 638 states have internal predecessors, (849), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 59 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:25:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 981 transitions. [2025-03-17 05:25:39,064 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 981 transitions. Word has length 141 [2025-03-17 05:25:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:39,064 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 981 transitions. [2025-03-17 05:25:39,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 981 transitions. [2025-03-17 05:25:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:39,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:39,066 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:39,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:25:39,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:39,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:39,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash -596831422, now seen corresponding path program 1 times [2025-03-17 05:25:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:39,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841332371] [2025-03-17 05:25:39,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:39,267 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-03-17 05:25:39,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:39,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:39,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:39,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:39,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:39,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:39,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:25:39,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 05:25:39,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:39,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:39,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841332371] [2025-03-17 05:25:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841332371] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-03-17 05:25:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025414553] [2025-03-17 05:25:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:39,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:39,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:39,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:39,763 INFO L87 Difference]: Start difference. First operand 708 states and 981 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:39,879 INFO L93 Difference]: Finished difference Result 1338 states and 1860 transitions. [2025-03-17 05:25:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:39,885 INFO L225 Difference]: With dead ends: 1338 [2025-03-17 05:25:39,885 INFO L226 Difference]: Without dead ends: 817 [2025-03-17 05:25:39,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:25:39,887 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 116 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:39,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 463 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-03-17 05:25:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 741. [2025-03-17 05:25:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 664 states have (on average 1.3403614457831325) internal successors, (890), 671 states have internal predecessors, (890), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 59 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:25:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1022 transitions. [2025-03-17 05:25:39,921 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1022 transitions. Word has length 141 [2025-03-17 05:25:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:39,921 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1022 transitions. [2025-03-17 05:25:39,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1022 transitions. [2025-03-17 05:25:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:25:39,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:39,924 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:39,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,126 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:40,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1901184515, now seen corresponding path program 1 times [2025-03-17 05:25:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095047836] [2025-03-17 05:25:40,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:40,127 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-03-17 05:25:40,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:40,129 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:25:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:25:40,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:40,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:40,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:25:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:40,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:40,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095047836] [2025-03-17 05:25:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095047836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:40,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115483654] [2025-03-17 05:25:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:40,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:40,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:40,323 INFO L87 Difference]: Start difference. First operand 741 states and 1022 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:40,435 INFO L93 Difference]: Finished difference Result 1669 states and 2287 transitions. [2025-03-17 05:25:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:40,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:25:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:40,440 INFO L225 Difference]: With dead ends: 1669 [2025-03-17 05:25:40,440 INFO L226 Difference]: Without dead ends: 1129 [2025-03-17 05:25:40,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:40,442 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 52 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:40,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 470 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-03-17 05:25:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 971. [2025-03-17 05:25:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 886 states have (on average 1.3216704288939052) internal successors, (1171), 895 states have internal predecessors, (1171), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 05:25:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1311 transitions. [2025-03-17 05:25:40,478 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1311 transitions. Word has length 141 [2025-03-17 05:25:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:40,478 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1311 transitions. [2025-03-17 05:25:40,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1311 transitions. [2025-03-17 05:25:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:25:40,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:40,480 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:40,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:40,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1868834919, now seen corresponding path program 1 times [2025-03-17 05:25:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7898388] [2025-03-17 05:25:40,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:40,681 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-03-17 05:25:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:40,683 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:25:40,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:25:40,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:40,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:40,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 05:25:40,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:40,887 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-03-17 05:25:40,915 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 24 treesize of output 23 [2025-03-17 05:25:41,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-17 05:25:41,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-17 05:25:41,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-17 05:25:41,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,341 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 45 treesize of output 41 [2025-03-17 05:25:41,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,635 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 71 treesize of output 49 [2025-03-17 05:25:41,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,667 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 84 treesize of output 67 [2025-03-17 05:25:41,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:41,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 74 [2025-03-17 05:25:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 57 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-17 05:25:41,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:42,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7898388] [2025-03-17 05:25:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7898388] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:42,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 20 [2025-03-17 05:25:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020572371] [2025-03-17 05:25:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:42,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:42,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:25:42,076 INFO L87 Difference]: Start difference. First operand 971 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:42,285 INFO L93 Difference]: Finished difference Result 1817 states and 2463 transitions. [2025-03-17 05:25:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:42,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-17 05:25:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:42,290 INFO L225 Difference]: With dead ends: 1817 [2025-03-17 05:25:42,290 INFO L226 Difference]: Without dead ends: 1111 [2025-03-17 05:25:42,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:25:42,292 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 61 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:42,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 627 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-03-17 05:25:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1107. [2025-03-17 05:25:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1008 states have (on average 1.3115079365079365) internal successors, (1322), 1019 states have internal predecessors, (1322), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1482 transitions. [2025-03-17 05:25:42,337 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1482 transitions. Word has length 142 [2025-03-17 05:25:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:42,337 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1482 transitions. [2025-03-17 05:25:42,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1482 transitions. [2025-03-17 05:25:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:42,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:42,339 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:42,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:42,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:42,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1452672157, now seen corresponding path program 1 times [2025-03-17 05:25:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015672948] [2025-03-17 05:25:42,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:42,542 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-03-17 05:25:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:42,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:42,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:42,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:42,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:42,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:42,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:42,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:25:42,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 05:25:42,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:42,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015672948] [2025-03-17 05:25:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015672948] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-17 05:25:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646845929] [2025-03-17 05:25:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:42,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:42,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:42,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:42,971 INFO L87 Difference]: Start difference. First operand 1107 states and 1482 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:43,092 INFO L93 Difference]: Finished difference Result 2048 states and 2760 transitions. [2025-03-17 05:25:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:25:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:43,097 INFO L225 Difference]: With dead ends: 2048 [2025-03-17 05:25:43,097 INFO L226 Difference]: Without dead ends: 1221 [2025-03-17 05:25:43,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:43,099 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:43,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 448 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-17 05:25:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1109. [2025-03-17 05:25:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1010 states have (on average 1.306930693069307) internal successors, (1320), 1021 states have internal predecessors, (1320), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1480 transitions. [2025-03-17 05:25:43,134 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1480 transitions. Word has length 143 [2025-03-17 05:25:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1480 transitions. [2025-03-17 05:25:43,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1480 transitions. [2025-03-17 05:25:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:43,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:43,136 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:43,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:43,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:43,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 373549282, now seen corresponding path program 1 times [2025-03-17 05:25:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349016537] [2025-03-17 05:25:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:43,338 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-03-17 05:25:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:43,339 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:43,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:43,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:43,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:43,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:25:43,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:43,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:25:43,699 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 77 treesize of output 41 [2025-03-17 05:25:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:43,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:43,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349016537] [2025-03-17 05:25:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349016537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843024245] [2025-03-17 05:25:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:43,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:25:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:43,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:25:43,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:43,716 INFO L87 Difference]: Start difference. First operand 1109 states and 1480 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:43,851 INFO L93 Difference]: Finished difference Result 1147 states and 1529 transitions. [2025-03-17 05:25:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:25:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:43,855 INFO L225 Difference]: With dead ends: 1147 [2025-03-17 05:25:43,855 INFO L226 Difference]: Without dead ends: 1145 [2025-03-17 05:25:43,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:43,856 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 119 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:43,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 822 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-17 05:25:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2025-03-17 05:25:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1046 states have (on average 1.2963671128107075) internal successors, (1356), 1057 states have internal predecessors, (1356), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1516 transitions. [2025-03-17 05:25:43,890 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1516 transitions. Word has length 143 [2025-03-17 05:25:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1516 transitions. [2025-03-17 05:25:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1516 transitions. [2025-03-17 05:25:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:43,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:43,892 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:43,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-03-17 05:25:44,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:44,092 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash 374472803, now seen corresponding path program 1 times [2025-03-17 05:25:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232097568] [2025-03-17 05:25:44,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:44,094 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-03-17 05:25:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:44,095 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:44,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:44,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:44,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:44,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:44,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:25:44,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:44,313 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-03-17 05:25:44,349 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-03-17 05:25:44,365 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-03-17 05:25:44,385 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 26 treesize of output 25 [2025-03-17 05:25:44,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:44,622 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 63 treesize of output 38 [2025-03-17 05:25:44,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:44,865 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 91 treesize of output 63 [2025-03-17 05:25:44,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:44,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 91 [2025-03-17 05:25:45,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:45,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 84 [2025-03-17 05:25:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 415 proven. 33 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-17 05:25:45,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:45,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:45,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232097568] [2025-03-17 05:25:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232097568] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:45,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 24 [2025-03-17 05:25:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531367204] [2025-03-17 05:25:45,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:45,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:45,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:25:45,623 INFO L87 Difference]: Start difference. First operand 1145 states and 1516 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:45,906 INFO L93 Difference]: Finished difference Result 2031 states and 2705 transitions. [2025-03-17 05:25:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:25:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:45,911 INFO L225 Difference]: With dead ends: 2031 [2025-03-17 05:25:45,911 INFO L226 Difference]: Without dead ends: 1166 [2025-03-17 05:25:45,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:25:45,914 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 67 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:45,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 619 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-03-17 05:25:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1163. [2025-03-17 05:25:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1064 states have (on average 1.2913533834586466) internal successors, (1374), 1075 states have internal predecessors, (1374), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1534 transitions. [2025-03-17 05:25:45,961 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1534 transitions. Word has length 143 [2025-03-17 05:25:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:45,961 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1534 transitions. [2025-03-17 05:25:45,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1534 transitions. [2025-03-17 05:25:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:45,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:45,963 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:45,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:46,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:46,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:46,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1043542211, now seen corresponding path program 1 times [2025-03-17 05:25:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406403758] [2025-03-17 05:25:46,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:46,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:46,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:46,168 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:46,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:46,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:46,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:46,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:46,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:46,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:25:46,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 05:25:46,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:46,628 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406403758] [2025-03-17 05:25:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406403758] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-03-17 05:25:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801880403] [2025-03-17 05:25:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:46,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:46,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:46,629 INFO L87 Difference]: Start difference. First operand 1163 states and 1534 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:46,750 INFO L93 Difference]: Finished difference Result 2077 states and 2749 transitions. [2025-03-17 05:25:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:46,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:25:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:46,754 INFO L225 Difference]: With dead ends: 2077 [2025-03-17 05:25:46,754 INFO L226 Difference]: Without dead ends: 1164 [2025-03-17 05:25:46,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:25:46,756 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 73 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:46,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 568 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-03-17 05:25:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1087. [2025-03-17 05:25:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 988 states have (on average 1.2894736842105263) internal successors, (1274), 999 states have internal predecessors, (1274), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1434 transitions. [2025-03-17 05:25:46,794 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1434 transitions. Word has length 143 [2025-03-17 05:25:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:46,795 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1434 transitions. [2025-03-17 05:25:46,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1434 transitions. [2025-03-17 05:25:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:25:46,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:46,796 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:46,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:46,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:46,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1033667132, now seen corresponding path program 1 times [2025-03-17 05:25:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:46,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347464743] [2025-03-17 05:25:46,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:46,997 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-03-17 05:25:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:47,000 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:47,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:47,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:25:47,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:25:47,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:47,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:47,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:25:47,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:47,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:47,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347464743] [2025-03-17 05:25:47,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347464743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:47,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:47,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039589381] [2025-03-17 05:25:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:47,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:47,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:47,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:47,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:47,195 INFO L87 Difference]: Start difference. First operand 1087 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:47,330 INFO L93 Difference]: Finished difference Result 1985 states and 2606 transitions. [2025-03-17 05:25:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:47,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:25:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:47,334 INFO L225 Difference]: With dead ends: 1985 [2025-03-17 05:25:47,334 INFO L226 Difference]: Without dead ends: 1148 [2025-03-17 05:25:47,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:47,335 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 39 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:47,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 546 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-17 05:25:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 899. [2025-03-17 05:25:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 807 states have (on average 1.2825278810408922) internal successors, (1035), 814 states have internal predecessors, (1035), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:25:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1179 transitions. [2025-03-17 05:25:47,365 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1179 transitions. Word has length 143 [2025-03-17 05:25:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1179 transitions. [2025-03-17 05:25:47,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1179 transitions. [2025-03-17 05:25:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:25:47,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:47,366 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:47,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-03-17 05:25:47,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:47,567 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:47,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -71258869, now seen corresponding path program 1 times [2025-03-17 05:25:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:47,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184167469] [2025-03-17 05:25:47,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:47,568 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-03-17 05:25:47,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:47,569 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:47,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-03-17 05:25:47,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:25:47,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:25:47,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:47,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:47,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:25:47,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:47,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:47,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184167469] [2025-03-17 05:25:47,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184167469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:47,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:47,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480703253] [2025-03-17 05:25:47,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:47,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:47,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:47,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:47,745 INFO L87 Difference]: Start difference. First operand 899 states and 1179 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:47,797 INFO L93 Difference]: Finished difference Result 1594 states and 2098 transitions. [2025-03-17 05:25:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:47,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-17 05:25:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:47,800 INFO L225 Difference]: With dead ends: 1594 [2025-03-17 05:25:47,800 INFO L226 Difference]: Without dead ends: 923 [2025-03-17 05:25:47,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:47,801 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:47,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-17 05:25:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 917. [2025-03-17 05:25:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 825 states have (on average 1.2763636363636364) internal successors, (1053), 832 states have internal predecessors, (1053), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:25:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1197 transitions. [2025-03-17 05:25:47,829 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1197 transitions. Word has length 144 [2025-03-17 05:25:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:47,829 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1197 transitions. [2025-03-17 05:25:47,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1197 transitions. [2025-03-17 05:25:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:25:47,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:47,831 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:47,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-03-17 05:25:48,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:48,035 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:48,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash -23211072, now seen corresponding path program 1 times [2025-03-17 05:25:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:48,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646126992] [2025-03-17 05:25:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:48,036 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-03-17 05:25:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:48,038 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:48,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-03-17 05:25:48,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:25:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:25:48,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:48,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:48,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 05:25:48,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:48,268 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-03-17 05:25:48,294 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 24 treesize of output 23 [2025-03-17 05:25:48,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:48,349 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 34 treesize of output 36 [2025-03-17 05:25:48,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:48,450 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 49 treesize of output 39 [2025-03-17 05:25:48,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2025-03-17 05:25:48,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2025-03-17 05:25:50,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:50,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 117 [2025-03-17 05:25:50,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:50,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 159 treesize of output 129 [2025-03-17 05:25:51,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:51,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 147 treesize of output 77 [2025-03-17 05:25:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 497 proven. 21 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-17 05:25:53,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:54,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646126992] [2025-03-17 05:25:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646126992] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:54,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [32] total 38 [2025-03-17 05:25:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253952156] [2025-03-17 05:25:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:25:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:54,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:25:54,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:25:54,947 INFO L87 Difference]: Start difference. First operand 917 states and 1197 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:55,853 INFO L93 Difference]: Finished difference Result 2024 states and 2643 transitions. [2025-03-17 05:25:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:25:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:55,858 INFO L225 Difference]: With dead ends: 2024 [2025-03-17 05:25:55,858 INFO L226 Difference]: Without dead ends: 1335 [2025-03-17 05:25:55,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=274, Invalid=1366, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:25:55,859 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 116 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:55,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 652 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:25:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-17 05:25:55,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1167. [2025-03-17 05:25:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1075 states have (on average 1.2893023255813953) internal successors, (1386), 1082 states have internal predecessors, (1386), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:25:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1530 transitions. [2025-03-17 05:25:55,892 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1530 transitions. Word has length 145 [2025-03-17 05:25:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:55,892 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1530 transitions. [2025-03-17 05:25:55,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1530 transitions. [2025-03-17 05:25:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:25:55,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:55,893 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:55,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2025-03-17 05:25:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:56,094 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1820162431, now seen corresponding path program 1 times [2025-03-17 05:25:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979760286] [2025-03-17 05:25:56,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:56,096 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-03-17 05:25:56,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:56,099 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:56,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-03-17 05:25:56,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:25:56,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:25:56,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:56,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:56,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:25:56,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:56,331 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-03-17 05:25:56,362 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-03-17 05:25:56,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:56,431 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-03-17 05:25:56,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:56,479 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-03-17 05:25:56,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:56,582 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-03-17 05:25:56,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:56,759 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 79 treesize of output 66 [2025-03-17 05:25:56,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:56,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 95 [2025-03-17 05:25:57,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:57,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 50 [2025-03-17 05:25:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 417 proven. 27 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-17 05:25:57,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:25:57,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:57,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979760286] [2025-03-17 05:25:57,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979760286] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:57,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:57,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2025-03-17 05:25:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903899695] [2025-03-17 05:25:57,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:57,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:57,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:57,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:57,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:25:57,311 INFO L87 Difference]: Start difference. First operand 1167 states and 1530 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:57,505 INFO L93 Difference]: Finished difference Result 2501 states and 3272 transitions. [2025-03-17 05:25:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:57,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:25:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:57,510 INFO L225 Difference]: With dead ends: 2501 [2025-03-17 05:25:57,510 INFO L226 Difference]: Without dead ends: 1645 [2025-03-17 05:25:57,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:25:57,513 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:57,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 388 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-03-17 05:25:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1510. [2025-03-17 05:25:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1400 states have (on average 1.2864285714285715) internal successors, (1801), 1409 states have internal predecessors, (1801), 84 states have call successors, (84), 25 states have call predecessors, (84), 25 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:25:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1969 transitions. [2025-03-17 05:25:57,579 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1969 transitions. Word has length 145 [2025-03-17 05:25:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:57,579 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1969 transitions. [2025-03-17 05:25:57,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:25:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1969 transitions. [2025-03-17 05:25:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:25:57,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:57,580 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:25:57,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:57,781 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -403812666, now seen corresponding path program 1 times [2025-03-17 05:25:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:57,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378948912] [2025-03-17 05:25:57,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:57,782 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-03-17 05:25:57,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:57,784 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:25:57,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2025-03-17 05:25:57,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:25:57,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:25:57,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:57,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:57,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 05:25:58,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:58,006 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-03-17 05:25:58,033 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 24 treesize of output 23 [2025-03-17 05:25:58,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:58,080 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 34 treesize of output 36 [2025-03-17 05:25:58,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:58,177 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 44 treesize of output 49 [2025-03-17 05:25:58,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-17 05:25:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2025-03-17 05:25:59,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:59,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 102 [2025-03-17 05:25:59,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:59,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 144 treesize of output 120 [2025-03-17 05:26:00,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:00,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 141 treesize of output 65 [2025-03-17 05:26:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 501 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-17 05:26:02,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:26:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:26:03,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378948912] [2025-03-17 05:26:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378948912] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:03,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [29] total 35 [2025-03-17 05:26:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258344246] [2025-03-17 05:26:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:26:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:26:03,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:26:03,705 INFO L87 Difference]: Start difference. First operand 1510 states and 1969 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:04,563 INFO L93 Difference]: Finished difference Result 2757 states and 3596 transitions. [2025-03-17 05:26:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:26:04,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:26:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:04,569 INFO L225 Difference]: With dead ends: 2757 [2025-03-17 05:26:04,569 INFO L226 Difference]: Without dead ends: 1645 [2025-03-17 05:26:04,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:26:04,573 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 207 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:04,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 732 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:26:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-03-17 05:26:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1493. [2025-03-17 05:26:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1382 states have (on average 1.2836468885672938) internal successors, (1774), 1391 states have internal predecessors, (1774), 84 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:26:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1942 transitions. [2025-03-17 05:26:04,632 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1942 transitions. Word has length 145 [2025-03-17 05:26:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:04,632 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1942 transitions. [2025-03-17 05:26:04,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1942 transitions. [2025-03-17 05:26:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:26:04,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:04,634 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:26:04,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-03-17 05:26:04,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:04,834 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:04,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash 327588865, now seen corresponding path program 1 times [2025-03-17 05:26:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:04,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489232878] [2025-03-17 05:26:04,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:04,835 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-03-17 05:26:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:04,837 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:04,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-03-17 05:26:04,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:26:05,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:26:05,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:05,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:05,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:26:05,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:05,060 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-03-17 05:26:05,089 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-03-17 05:26:05,108 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-03-17 05:26:05,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:05,171 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-03-17 05:26:05,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:05,225 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-03-17 05:26:05,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:05,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 71 [2025-03-17 05:26:05,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:05,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 99 [2025-03-17 05:26:05,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:05,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 45 [2025-03-17 05:26:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 425 proven. 27 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-17 05:26:05,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:26:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:26:05,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:05,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489232878] [2025-03-17 05:26:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489232878] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2025-03-17 05:26:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003533867] [2025-03-17 05:26:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:05,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:26:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:26:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:26:05,891 INFO L87 Difference]: Start difference. First operand 1493 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:06,089 INFO L93 Difference]: Finished difference Result 2663 states and 3472 transitions. [2025-03-17 05:26:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:26:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:26:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:06,094 INFO L225 Difference]: With dead ends: 2663 [2025-03-17 05:26:06,094 INFO L226 Difference]: Without dead ends: 1572 [2025-03-17 05:26:06,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:26:06,096 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:06,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 540 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:26:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-17 05:26:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1375. [2025-03-17 05:26:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1293 states have (on average 1.2907965970610982) internal successors, (1669), 1298 states have internal predecessors, (1669), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:26:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1793 transitions. [2025-03-17 05:26:06,134 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1793 transitions. Word has length 145 [2025-03-17 05:26:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:06,135 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1793 transitions. [2025-03-17 05:26:06,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1793 transitions. [2025-03-17 05:26:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:26:06,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:06,136 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:26:06,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2025-03-17 05:26:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:06,337 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:06,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1469362494, now seen corresponding path program 1 times [2025-03-17 05:26:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358939060] [2025-03-17 05:26:06,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:06,337 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-03-17 05:26:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:06,339 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-03-17 05:26:06,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:26:06,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:26:06,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:06,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:06,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 05:26:06,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:06,643 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-03-17 05:26:06,677 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 29 treesize of output 13 [2025-03-17 05:26:06,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:06,761 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 40 treesize of output 27 [2025-03-17 05:26:06,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:06,803 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 40 treesize of output 27 [2025-03-17 05:26:06,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2025-03-17 05:26:07,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 50 [2025-03-17 05:26:08,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:08,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 105 [2025-03-17 05:26:08,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:08,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 116 [2025-03-17 05:26:09,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:09,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 169 treesize of output 81 [2025-03-17 05:26:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 472 proven. 33 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-17 05:26:17,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:26:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:26:19,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358939060] [2025-03-17 05:26:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358939060] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [34] total 40 [2025-03-17 05:26:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578818538] [2025-03-17 05:26:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:19,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:26:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:19,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:26:19,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:26:19,600 INFO L87 Difference]: Start difference. First operand 1375 states and 1793 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:21,361 INFO L93 Difference]: Finished difference Result 2459 states and 3210 transitions. [2025-03-17 05:26:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:26:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:26:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:21,366 INFO L225 Difference]: With dead ends: 2459 [2025-03-17 05:26:21,366 INFO L226 Difference]: Without dead ends: 1486 [2025-03-17 05:26:21,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:26:21,368 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 57 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:21,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 787 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:26:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-17 05:26:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1348. [2025-03-17 05:26:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1266 states have (on average 1.2898894154818326) internal successors, (1633), 1271 states have internal predecessors, (1633), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:26:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1757 transitions. [2025-03-17 05:26:21,406 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1757 transitions. Word has length 145 [2025-03-17 05:26:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:21,407 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1757 transitions. [2025-03-17 05:26:21,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1757 transitions. [2025-03-17 05:26:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:26:21,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:21,408 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:26:21,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2025-03-17 05:26:21,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:21,609 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:21,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1860467192, now seen corresponding path program 1 times [2025-03-17 05:26:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:21,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921690315] [2025-03-17 05:26:21,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:21,609 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-03-17 05:26:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:21,611 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:21,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2025-03-17 05:26:21,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:26:21,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:26:21,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:21,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:21,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 05:26:21,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:21,827 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-03-17 05:26:21,854 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 24 treesize of output 23 [2025-03-17 05:26:21,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:21,980 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 45 treesize of output 41 [2025-03-17 05:26:22,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:22,096 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 49 treesize of output 39 [2025-03-17 05:26:22,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2025-03-17 05:26:22,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2025-03-17 05:26:24,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:24,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 99 [2025-03-17 05:26:24,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:24,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 117 [2025-03-17 05:26:25,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:25,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 85 [2025-03-17 05:26:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 485 proven. 33 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-17 05:26:38,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:26:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:26:41,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:41,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921690315] [2025-03-17 05:26:41,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921690315] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:41,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:41,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [35] total 41 [2025-03-17 05:26:41,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285870242] [2025-03-17 05:26:41,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:41,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:26:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:41,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:26:41,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:26:41,608 INFO L87 Difference]: Start difference. First operand 1348 states and 1757 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:43,716 INFO L93 Difference]: Finished difference Result 2355 states and 3079 transitions. [2025-03-17 05:26:43,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:26:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:26:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:43,721 INFO L225 Difference]: With dead ends: 2355 [2025-03-17 05:26:43,721 INFO L226 Difference]: Without dead ends: 1409 [2025-03-17 05:26:43,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=309, Invalid=1583, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 05:26:43,722 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 157 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:43,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 764 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:26:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-17 05:26:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1185. [2025-03-17 05:26:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1133 states have (on average 1.3053839364518975) internal successors, (1479), 1134 states have internal predecessors, (1479), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:26:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1559 transitions. [2025-03-17 05:26:43,748 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1559 transitions. Word has length 145 [2025-03-17 05:26:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:43,748 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1559 transitions. [2025-03-17 05:26:43,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1559 transitions. [2025-03-17 05:26:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:26:43,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:43,749 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:26:43,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-03-17 05:26:43,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:43,950 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash 867790984, now seen corresponding path program 1 times [2025-03-17 05:26:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806457174] [2025-03-17 05:26:43,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:43,951 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-03-17 05:26:43,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:43,952 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:43,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2025-03-17 05:26:44,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:26:44,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:26:44,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:44,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:44,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:26:44,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:26:44,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:44,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806457174] [2025-03-17 05:26:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806457174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:44,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:44,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769710947] [2025-03-17 05:26:44,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:44,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:26:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:44,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:26:44,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:26:44,166 INFO L87 Difference]: Start difference. First operand 1185 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:44,505 INFO L93 Difference]: Finished difference Result 2329 states and 3074 transitions. [2025-03-17 05:26:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:26:44,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-17 05:26:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:44,510 INFO L225 Difference]: With dead ends: 2329 [2025-03-17 05:26:44,510 INFO L226 Difference]: Without dead ends: 1546 [2025-03-17 05:26:44,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:44,511 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:44,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 404 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:26:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-17 05:26:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1337. [2025-03-17 05:26:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1285 states have (on average 1.3003891050583658) internal successors, (1671), 1286 states have internal predecessors, (1671), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:26:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1751 transitions. [2025-03-17 05:26:44,539 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1751 transitions. Word has length 146 [2025-03-17 05:26:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:44,540 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1751 transitions. [2025-03-17 05:26:44,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1751 transitions. [2025-03-17 05:26:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:26:44,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:44,541 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:26:44,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:44,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:44,743 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:44,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 362232359, now seen corresponding path program 1 times [2025-03-17 05:26:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680810522] [2025-03-17 05:26:44,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:44,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:44,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:44,746 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:44,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2025-03-17 05:26:44,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:26:44,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:26:44,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:44,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:44,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:26:44,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:26:44,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:44,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:44,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680810522] [2025-03-17 05:26:44,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680810522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:44,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:44,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:26:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597340425] [2025-03-17 05:26:44,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:44,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:44,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:44,936 INFO L87 Difference]: Start difference. First operand 1337 states and 1751 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:45,054 INFO L93 Difference]: Finished difference Result 2382 states and 3136 transitions. [2025-03-17 05:26:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:26:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-17 05:26:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:45,058 INFO L225 Difference]: With dead ends: 2382 [2025-03-17 05:26:45,058 INFO L226 Difference]: Without dead ends: 1483 [2025-03-17 05:26:45,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:26:45,059 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 65 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:45,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 826 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:26:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2025-03-17 05:26:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1373. [2025-03-17 05:26:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1321 states have (on average 1.2922028766086298) internal successors, (1707), 1322 states have internal predecessors, (1707), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:26:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1787 transitions. [2025-03-17 05:26:45,086 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1787 transitions. Word has length 146 [2025-03-17 05:26:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:45,086 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1787 transitions. [2025-03-17 05:26:45,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:26:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1787 transitions. [2025-03-17 05:26:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:26:45,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:45,087 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:26:45,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2025-03-17 05:26:45,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:45,288 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:45,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -631237277, now seen corresponding path program 1 times [2025-03-17 05:26:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993856613] [2025-03-17 05:26:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:45,288 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-03-17 05:26:45,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:45,290 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:26:45,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2025-03-17 05:26:45,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:26:45,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:26:45,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:45,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:45,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:26:45,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:45,505 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-03-17 05:26:45,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:26:45,536 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 25 treesize of output 24 [2025-03-17 05:26:45,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:45,587 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 40 treesize of output 27 [2025-03-17 05:26:45,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:45,669 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 44 treesize of output 49 [2025-03-17 05:26:45,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:45,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 86