./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.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-81.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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:28:14,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:28:14,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:28:14,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:28:14,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:28:14,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:28:14,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:28:14,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:28:14,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:28:14,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:28:14,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:28:14,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:28:14,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:28:14,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:28:14,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:28:14,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:28:14,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:28:14,840 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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2025-03-17 05:28:15,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:28:15,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:28:15,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:28:15,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:28:15,100 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:28:15,102 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-81.i [2025-03-17 05:28:16,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68334e8f8/597e1ffb373e4bfc9b1963d9704b1c29/FLAG59e7e5048 [2025-03-17 05:28:16,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:28:16,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2025-03-17 05:28:16,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68334e8f8/597e1ffb373e4bfc9b1963d9704b1c29/FLAG59e7e5048 [2025-03-17 05:28:16,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68334e8f8/597e1ffb373e4bfc9b1963d9704b1c29 [2025-03-17 05:28:16,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:28:16,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:28:16,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:28:16,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:28:16,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:28:16,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:28:16" (1/1) ... [2025-03-17 05:28:16,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f93efe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:16, skipping insertion in model container [2025-03-17 05:28:16,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:28:16" (1/1) ... [2025-03-17 05:28:16,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:28:16,986 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-81.i[916,929] [2025-03-17 05:28:17,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:28:17,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:28:17,068 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-81.i[916,929] [2025-03-17 05:28:17,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:28:17,132 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:28:17,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17 WrapperNode [2025-03-17 05:28:17,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:28:17,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:28:17,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:28:17,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:28:17,138 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:28:17" (1/1) ... [2025-03-17 05:28:17,151 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:28:17" (1/1) ... [2025-03-17 05:28:17,198 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-03-17 05:28:17,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:28:17,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:28:17,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:28:17,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:28:17,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,247 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2025-03-17 05:28:17,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:28:17,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:28:17,280 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:28:17,280 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:28:17,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (1/1) ... [2025-03-17 05:28:17,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:28:17,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:28:17,310 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:28:17,312 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:28:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:28:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:28:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:28:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:28:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:28:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:28:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:28:17,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:28:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:28:17,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:28:17,452 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:28:17,453 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:28:17,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise110#1;havoc property_#t~ite122#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~ite135#1;havoc property_#t~mem131#1;havoc property_#t~mem128#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite152#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite149#1;havoc property_#t~mem146#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem148#1;havoc property_#t~mem147#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~short153#1; [2025-03-17 05:28:17,850 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-17 05:28:17,851 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:28:17,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:28:17,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:28:17,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:17 BoogieIcfgContainer [2025-03-17 05:28:17,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:28:17,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:28:17,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:28:17,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:28:17,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:28:16" (1/3) ... [2025-03-17 05:28:17,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd05f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:28:17, skipping insertion in model container [2025-03-17 05:28:17,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:17" (2/3) ... [2025-03-17 05:28:17,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd05f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:28:17, skipping insertion in model container [2025-03-17 05:28:17,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:17" (3/3) ... [2025-03-17 05:28:17,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2025-03-17 05:28:17,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:28:17,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-81.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:28:17,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:28:17,943 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;@427763bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:28:17,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:28:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 103 states have internal predecessors, (149), 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:28:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:28:17,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:17,960 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:28:17,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:17,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash 945434997, now seen corresponding path program 1 times [2025-03-17 05:28:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138559452] [2025-03-17 05:28:17,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:18,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:28:18,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:28:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:18,244 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:28:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:18,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138559452] [2025-03-17 05:28:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138559452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810385811] [2025-03-17 05:28:18,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:18,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:28:18,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:28:18,249 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:28:18,251 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:28:18,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:28:18,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:28:18,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:18,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:18,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:28:18,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:18,457 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:28:18,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810385811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:18,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:28:18,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:28:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027886605] [2025-03-17 05:28:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:28:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:18,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:28:18,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:28:18,481 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 103 states have internal predecessors, (149), 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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:28:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:18,506 INFO L93 Difference]: Finished difference Result 243 states and 386 transitions. [2025-03-17 05:28:18,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:28:18,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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 144 [2025-03-17 05:28:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:18,513 INFO L225 Difference]: With dead ends: 243 [2025-03-17 05:28:18,513 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 05:28:18,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:28:18,517 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:18,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:28:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 05:28:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-17 05:28:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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:28:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2025-03-17 05:28:18,545 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 144 [2025-03-17 05:28:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:18,546 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2025-03-17 05:28:18,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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:28:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2025-03-17 05:28:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:28:18,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:18,550 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:28:18,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:28:18,750 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:28:18,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:18,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1524327719, now seen corresponding path program 1 times [2025-03-17 05:28:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463113701] [2025-03-17 05:28:18,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:28:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:28:18,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:18,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:19,076 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:28:19,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463113701] [2025-03-17 05:28:19,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463113701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:19,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:19,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:28:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961932898] [2025-03-17 05:28:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:19,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:28:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:28:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:19,079 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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:28:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:19,161 INFO L93 Difference]: Finished difference Result 320 states and 476 transitions. [2025-03-17 05:28:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:28:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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:28:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:19,163 INFO L225 Difference]: With dead ends: 320 [2025-03-17 05:28:19,163 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 05:28:19,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:19,166 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 112 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:19,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 338 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 05:28:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2025-03-17 05:28:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 146 states have internal predecessors, (201), 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:28:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 273 transitions. [2025-03-17 05:28:19,197 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 273 transitions. Word has length 144 [2025-03-17 05:28:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:19,198 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 273 transitions. [2025-03-17 05:28:19,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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:28:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 273 transitions. [2025-03-17 05:28:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:28:19,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:19,202 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:28:19,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:28:19,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:19,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1691405241, now seen corresponding path program 1 times [2025-03-17 05:28:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154710889] [2025-03-17 05:28:19,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:19,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:28:19,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:28:19,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:19,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:19,452 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:28:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154710889] [2025-03-17 05:28:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154710889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10789215] [2025-03-17 05:28:19,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:19,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:28:19,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:28:19,456 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:28:19,458 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:28:19,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:28:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:28:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:19,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:28:19,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:19,678 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:28:19,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10789215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:28:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:28:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442444291] [2025-03-17 05:28:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:19,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:28:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:19,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:28:19,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:28:19,681 INFO L87 Difference]: Start difference. First operand 185 states and 273 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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:28:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:19,718 INFO L93 Difference]: Finished difference Result 307 states and 454 transitions. [2025-03-17 05:28:19,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:28:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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:28:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:19,722 INFO L225 Difference]: With dead ends: 307 [2025-03-17 05:28:19,722 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 05:28:19,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:28:19,724 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:19,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:28:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 05:28:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-17 05:28:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.3716216216216217) internal successors, (203), 148 states have internal predecessors, (203), 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:28:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2025-03-17 05:28:19,740 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 145 [2025-03-17 05:28:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:19,742 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2025-03-17 05:28:19,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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:28:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2025-03-17 05:28:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:28:19,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:19,746 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:28:19,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:28:19,946 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,SelfDestructingSolverStorable2 [2025-03-17 05:28:19,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 996092343, now seen corresponding path program 1 times [2025-03-17 05:28:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825683392] [2025-03-17 05:28:19,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:19,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:28:19,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:28:19,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:20,175 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:28:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825683392] [2025-03-17 05:28:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825683392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:28:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900839851] [2025-03-17 05:28:20,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:20,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:28:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:20,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:28:20,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:20,179 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:28:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:20,346 INFO L93 Difference]: Finished difference Result 368 states and 540 transitions. [2025-03-17 05:28:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:28:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 147 [2025-03-17 05:28:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:20,348 INFO L225 Difference]: With dead ends: 368 [2025-03-17 05:28:20,348 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 05:28:20,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:28:20,349 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 174 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:20,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 473 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 05:28:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2025-03-17 05:28:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 177 states have (on average 1.384180790960452) internal successors, (245), 177 states have internal predecessors, (245), 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:28:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 317 transitions. [2025-03-17 05:28:20,367 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 317 transitions. Word has length 147 [2025-03-17 05:28:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:20,367 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 317 transitions. [2025-03-17 05:28:20,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:28:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 317 transitions. [2025-03-17 05:28:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:28:20,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:20,371 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, 1, 1] [2025-03-17 05:28:20,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:28:20,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1899352163, now seen corresponding path program 1 times [2025-03-17 05:28:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850229665] [2025-03-17 05:28:20,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:20,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:28:20,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:28:20,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:20,978 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:28:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850229665] [2025-03-17 05:28:20,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850229665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:20,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:28:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198326284] [2025-03-17 05:28:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:20,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:28:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:20,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:28:20,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:20,982 INFO L87 Difference]: Start difference. First operand 216 states and 317 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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:28:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:21,094 INFO L93 Difference]: Finished difference Result 438 states and 635 transitions. [2025-03-17 05:28:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:28:21,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 149 [2025-03-17 05:28:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:21,097 INFO L225 Difference]: With dead ends: 438 [2025-03-17 05:28:21,097 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 05:28:21,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:28:21,099 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 76 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:21,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1004 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 05:28:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2025-03-17 05:28:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.3884615384615384) internal successors, (361), 261 states have internal predecessors, (361), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:28:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 437 transitions. [2025-03-17 05:28:21,128 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 437 transitions. Word has length 149 [2025-03-17 05:28:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:21,128 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 437 transitions. [2025-03-17 05:28:21,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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:28:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 437 transitions. [2025-03-17 05:28:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:28:21,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:21,130 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, 1, 1] [2025-03-17 05:28:21,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:28:21,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash -138704126, now seen corresponding path program 1 times [2025-03-17 05:28:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120057442] [2025-03-17 05:28:21,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:21,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:28:21,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:28:21,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:21,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:21,520 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:28:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120057442] [2025-03-17 05:28:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120057442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:21,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:28:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161900212] [2025-03-17 05:28:21,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:28:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:21,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:28:21,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:21,523 INFO L87 Difference]: Start difference. First operand 303 states and 437 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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:28:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:21,622 INFO L93 Difference]: Finished difference Result 568 states and 818 transitions. [2025-03-17 05:28:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:28:21,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 149 [2025-03-17 05:28:21,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:21,629 INFO L225 Difference]: With dead ends: 568 [2025-03-17 05:28:21,629 INFO L226 Difference]: Without dead ends: 381 [2025-03-17 05:28:21,631 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:28:21,631 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 136 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:21,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 811 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-17 05:28:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 335. [2025-03-17 05:28:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 292 states have (on average 1.393835616438356) internal successors, (407), 293 states have internal predecessors, (407), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:28:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 483 transitions. [2025-03-17 05:28:21,654 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 483 transitions. Word has length 149 [2025-03-17 05:28:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:21,655 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 483 transitions. [2025-03-17 05:28:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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:28:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 483 transitions. [2025-03-17 05:28:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:28:21,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:21,657 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, 1, 1, 1] [2025-03-17 05:28:21,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:28:21,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:21,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 931641939, now seen corresponding path program 1 times [2025-03-17 05:28:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:21,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792528139] [2025-03-17 05:28:21,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:21,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:28:21,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:28:21,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:22,042 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:28:22,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:28:22,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792528139] [2025-03-17 05:28:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792528139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:22,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:22,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:28:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109219084] [2025-03-17 05:28:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:22,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:28:22,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:28:22,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:28:22,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:22,044 INFO L87 Difference]: Start difference. First operand 335 states and 483 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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:28:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:22,123 INFO L93 Difference]: Finished difference Result 635 states and 908 transitions. [2025-03-17 05:28:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:28:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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 150 [2025-03-17 05:28:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:22,126 INFO L225 Difference]: With dead ends: 635 [2025-03-17 05:28:22,126 INFO L226 Difference]: Without dead ends: 432 [2025-03-17 05:28:22,127 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:28:22,127 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 108 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:22,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 757 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-17 05:28:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 335. [2025-03-17 05:28:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 292 states have (on average 1.393835616438356) internal successors, (407), 293 states have internal predecessors, (407), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:28:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 483 transitions. [2025-03-17 05:28:22,141 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 483 transitions. Word has length 150 [2025-03-17 05:28:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:22,142 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 483 transitions. [2025-03-17 05:28:22,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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:28:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 483 transitions. [2025-03-17 05:28:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:28:22,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:22,143 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, 1, 1, 1, 1] [2025-03-17 05:28:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:28:22,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2077947679, now seen corresponding path program 1 times [2025-03-17 05:28:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:28:22,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992855078] [2025-03-17 05:28:22,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:28:22,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:28:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:28:22,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:28:22,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:28:22,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:28:22,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:28:22,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:28:22,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:28:22,334 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:28:22,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:28:22,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:28:22,341 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:22,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:28:22,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:28:22 BoogieIcfgContainer [2025-03-17 05:28:22,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:28:22,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:28:22,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:28:22,429 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:28:22,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:17" (3/4) ... [2025-03-17 05:28:22,431 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:28:22,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:28:22,432 INFO L158 Benchmark]: Toolchain (without parser) took 5576.31ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 106.7MB in the beginning and 115.2MB in the end (delta: -8.5MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. [2025-03-17 05:28:22,432 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:28:22,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.61ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:28:22,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.40ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 85.9MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:28:22,432 INFO L158 Benchmark]: Boogie Preprocessor took 77.90ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 81.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:28:22,433 INFO L158 Benchmark]: IcfgBuilder took 590.56ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 44.0MB in the end (delta: 37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:28:22,433 INFO L158 Benchmark]: TraceAbstraction took 4555.73ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 43.5MB in the beginning and 115.3MB in the end (delta: -71.8MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2025-03-17 05:28:22,433 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 310.4MB. Free memory was 115.3MB in the beginning and 115.2MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:28:22,434 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.28ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.61ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.40ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 85.9MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.90ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 81.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 590.56ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 44.0MB in the end (delta: 37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4555.73ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 43.5MB in the beginning and 115.3MB in the end (delta: -71.8MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 310.4MB. Free memory was 115.3MB in the beginning and 115.2MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -8; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 5; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR signed_long_int_Array_0[0] [L102] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L103] EXPR unsigned_short_int_Array_0[0][0] [L103] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] double_Array_0[1] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] double_Array_0[2] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] double_Array_0[3] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_)); VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] EXPR last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_) [L44] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] [L45] EXPR signed_char_Array_0[2] [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = (signed_char_Array_0[2] + signed_char_Array_0[0]) [L50] EXPR signed_char_Array_0[2] [L50] EXPR signed_char_Array_0[1] [L50] unsigned char stepLocal_1 = signed_char_Array_0[2] >= signed_char_Array_0[1]; [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0]) [L54] EXPR unsigned_short_int_Array_0[1][0] [L54] EXPR unsigned_short_int_Array_0[0][1] [L54] unsigned_short_int_Array_0[0][0] = ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]) [L56] EXPR signed_char_Array_0[1] [L56] signed char stepLocal_2 = signed_char_Array_0[1]; [L57] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(stepLocal_2 > unsigned_short_int_Array_0[1][0]) [L64] EXPR unsigned_short_int_Array_0[1][1] [L64] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR double_Array_0[3] [L67] EXPR double_Array_0[2] [L67] EXPR double_Array_0[1] [L67] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L67] EXPR double_Array_0[3] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[4] = ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 [L106] EXPR double_Array_0[4] [L106] EXPR double_Array_0[3] [L106] EXPR double_Array_0[2] [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L106] EXPR double_Array_0[3] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106-L107] return (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 203 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 4074 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2745 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 1329 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 191 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1468 NumberOfCodeBlocks, 1468 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1308 ConstructedInterpolants, 0 QuantifiedInterpolants, 2459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 975 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 5423/5508 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:28:22,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-81.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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:28:24,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:28:24,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:28:24,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:28:24,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:28:24,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:28:24,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:28:24,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:28:24,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:28:24,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:28:24,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:28:24,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:28:24,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:28:24,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:28:24,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:28:24,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:28:24,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:28:24,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:28:24,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:28:24,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:28:24,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:28:24,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:28:24,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:28:24,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:28:24,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:28:24,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:28:24,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:28:24,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:28:24,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:28:24,359 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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2025-03-17 05:28:24,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:28:24,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:28:24,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:28:24,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:28:24,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:28:24,599 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-81.i [2025-03-17 05:28:25,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd18f527/fdfe45d03b344716a86fd7b294f32906/FLAGec916fdcd [2025-03-17 05:28:25,941 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:28:25,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2025-03-17 05:28:25,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd18f527/fdfe45d03b344716a86fd7b294f32906/FLAGec916fdcd [2025-03-17 05:28:26,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd18f527/fdfe45d03b344716a86fd7b294f32906 [2025-03-17 05:28:26,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:28:26,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:28:26,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:28:26,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:28:26,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:28:26,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25312a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26, skipping insertion in model container [2025-03-17 05:28:26,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:28:26,420 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-81.i[916,929] [2025-03-17 05:28:26,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:28:26,487 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:28:26,494 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-81.i[916,929] [2025-03-17 05:28:26,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:28:26,546 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:28:26,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26 WrapperNode [2025-03-17 05:28:26,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:28:26,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:28:26,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:28:26,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:28:26,553 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:28:26" (1/1) ... [2025-03-17 05:28:26,570 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:28:26" (1/1) ... [2025-03-17 05:28:26,606 INFO L138 Inliner]: procedures = 36, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2025-03-17 05:28:26,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:28:26,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:28:26,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:28:26,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:28:26,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,655 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2025-03-17 05:28:26,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:28:26,695 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:28:26,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:28:26,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:28:26,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (1/1) ... [2025-03-17 05:28:26,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:28:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:28:26,721 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:28:26,724 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:28:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:28:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:28:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:28:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:28:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:28:26,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:28:26,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:28:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:28:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:28:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:28:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:28:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:28:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:28:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:28:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:28:26,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:28:26,905 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:28:26,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:28:37,204 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite106#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite120#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~short125#1;havoc property_#t~ite133#1;havoc property_#t~mem129#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite150#1;havoc property_#t~mem139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite147#1;havoc property_#t~mem144#1;havoc property_#t~mem140#1;havoc property_#t~ite143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~short151#1; [2025-03-17 05:28:37,236 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-03-17 05:28:37,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:28:37,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:28:37,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:28:37,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:37 BoogieIcfgContainer [2025-03-17 05:28:37,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:28:37,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:28:37,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:28:37,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:28:37,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:28:26" (1/3) ... [2025-03-17 05:28:37,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf015dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:28:37, skipping insertion in model container [2025-03-17 05:28:37,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:28:26" (2/3) ... [2025-03-17 05:28:37,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf015dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:28:37, skipping insertion in model container [2025-03-17 05:28:37,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:37" (3/3) ... [2025-03-17 05:28:37,250 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2025-03-17 05:28:37,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:28:37,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-81.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:28:37,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:28:37,304 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;@239600e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:28:37,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:28:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 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:28:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:28:37,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:37,316 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:28:37,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1175957795, now seen corresponding path program 1 times [2025-03-17 05:28:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:37,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870287373] [2025-03-17 05:28:37,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:37,329 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:28:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:37,335 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:28:37,337 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:28:37,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:28:37,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:28:37,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:37,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:37,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:28:37,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-17 05:28:37,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:37,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870287373] [2025-03-17 05:28:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870287373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:28:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320641825] [2025-03-17 05:28:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:37,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:28:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:37,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:28:37,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:28:37,696 INFO L87 Difference]: Start difference. First operand has 115 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:28:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:37,718 INFO L93 Difference]: Finished difference Result 227 states and 358 transitions. [2025-03-17 05:28:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:28:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 143 [2025-03-17 05:28:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:37,728 INFO L225 Difference]: With dead ends: 227 [2025-03-17 05:28:37,728 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 05:28:37,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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:28:37,734 INFO L435 NwaCegarLoop]: 165 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, 165 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:28:37,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:28:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 05:28:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 05:28:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 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:28:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-03-17 05:28:37,774 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 143 [2025-03-17 05:28:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:37,775 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-03-17 05:28:37,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:28:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-03-17 05:28:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:28:37,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:37,780 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:28:37,789 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:28:37,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:28:37,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1988567829, now seen corresponding path program 1 times [2025-03-17 05:28:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629644215] [2025-03-17 05:28:37,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:37,989 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:28:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:37,991 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:28:37,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:28:38,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:28:38,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:28:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:38,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:38,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:28:38,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:39,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-17 05:28:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-17 05:28:39,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:28:39,931 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:28:39,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629644215] [2025-03-17 05:28:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629644215] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:39,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:28:39,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-17 05:28:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058338005] [2025-03-17 05:28:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:39,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:28:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:39,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:28:39,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:28:39,937 INFO L87 Difference]: Start difference. First operand 113 states and 165 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:28:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:40,158 INFO L93 Difference]: Finished difference Result 281 states and 406 transitions. [2025-03-17 05:28:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:28:40,159 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:28:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:40,161 INFO L225 Difference]: With dead ends: 281 [2025-03-17 05:28:40,163 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 05:28:40,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:28:40,164 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 134 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:40,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 548 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:28:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 05:28:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2025-03-17 05:28:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 144 states have internal predecessors, (199), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:28:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2025-03-17 05:28:40,185 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 143 [2025-03-17 05:28:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:40,186 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2025-03-17 05:28:40,186 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:28:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2025-03-17 05:28:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:28:40,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:40,188 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:28:40,196 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:28:40,392 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:28:40,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1897575242, now seen corresponding path program 1 times [2025-03-17 05:28:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093297978] [2025-03-17 05:28:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:40,393 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:28:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:40,395 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:28:40,396 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:28:40,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:28:40,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:28:40,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:40,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:40,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:28:40,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:40,657 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:28:40,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:40,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093297978] [2025-03-17 05:28:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093297978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:28:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623493717] [2025-03-17 05:28:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:40,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:28:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:40,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:28:40,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:40,659 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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:28:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:40,726 INFO L93 Difference]: Finished difference Result 335 states and 483 transitions. [2025-03-17 05:28:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:28:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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:28:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:40,729 INFO L225 Difference]: With dead ends: 335 [2025-03-17 05:28:40,732 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 05:28:40,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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:28:40,733 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:40,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 05:28:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 05:28:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.380952380952381) internal successors, (203), 148 states have internal predecessors, (203), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:28:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 243 transitions. [2025-03-17 05:28:40,752 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 243 transitions. Word has length 143 [2025-03-17 05:28:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:40,752 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 243 transitions. [2025-03-17 05:28:40,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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:28:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 243 transitions. [2025-03-17 05:28:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:28:40,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:40,755 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:28:40,766 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 (4)] Ended with exit code 0 [2025-03-17 05:28:40,955 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:28:40,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:40,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 408842248, now seen corresponding path program 1 times [2025-03-17 05:28:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246194467] [2025-03-17 05:28:40,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:40,957 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:28:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:40,958 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:28:40,960 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:28:41,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:28:41,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:28:41,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:41,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:28:41,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-17 05:28:42,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:28:42,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:28:42,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246194467] [2025-03-17 05:28:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246194467] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:42,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:28:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-17 05:28:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439332897] [2025-03-17 05:28:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:28:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:42,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:28:42,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:28:42,345 INFO L87 Difference]: Start difference. First operand 170 states and 243 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:28:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:42,499 INFO L93 Difference]: Finished difference Result 393 states and 558 transitions. [2025-03-17 05:28:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:28:42,500 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:28:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:42,501 INFO L225 Difference]: With dead ends: 393 [2025-03-17 05:28:42,501 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 05:28:42,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:28:42,502 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 122 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:42,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 570 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 05:28:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2025-03-17 05:28:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.3865030674846626) internal successors, (226), 164 states have internal predecessors, (226), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:28:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 266 transitions. [2025-03-17 05:28:42,511 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 266 transitions. Word has length 145 [2025-03-17 05:28:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:42,511 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 266 transitions. [2025-03-17 05:28:42,511 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:28:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 266 transitions. [2025-03-17 05:28:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:28:42,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:42,512 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:28:42,528 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:28:42,713 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:28:42,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1994523131, now seen corresponding path program 1 times [2025-03-17 05:28:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651546754] [2025-03-17 05:28:42,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:42,714 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:28:42,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:42,716 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:28:42,716 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:28:42,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:28:43,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:28:43,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:43,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:43,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:28:43,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:43,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:28:44,702 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:28:44,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:44,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651546754] [2025-03-17 05:28:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651546754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:44,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:44,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:28:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5917075] [2025-03-17 05:28:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:28:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:44,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:28:44,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:28:44,703 INFO L87 Difference]: Start difference. First operand 186 states and 266 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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:28:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:45,937 INFO L93 Difference]: Finished difference Result 502 states and 717 transitions. [2025-03-17 05:28:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:28:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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:28:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:45,940 INFO L225 Difference]: With dead ends: 502 [2025-03-17 05:28:45,940 INFO L226 Difference]: Without dead ends: 317 [2025-03-17 05:28:45,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:28:45,941 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 146 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:45,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 558 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:28:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-17 05:28:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 292. [2025-03-17 05:28:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 249 states have (on average 1.3694779116465863) internal successors, (341), 250 states have internal predecessors, (341), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:28:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 417 transitions. [2025-03-17 05:28:45,964 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 417 transitions. Word has length 146 [2025-03-17 05:28:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:45,964 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 417 transitions. [2025-03-17 05:28:45,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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:28:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 417 transitions. [2025-03-17 05:28:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:28:45,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:45,965 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:28:45,977 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 (6)] Ended with exit code 0 [2025-03-17 05:28:46,168 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:28:46,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:46,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1020017817, now seen corresponding path program 1 times [2025-03-17 05:28:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504416279] [2025-03-17 05:28:46,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:46,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:46,171 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:28:46,172 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:28:46,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:28:46,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:28:46,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:46,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:28:46,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:46,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:46,824 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 155 treesize of output 65 [2025-03-17 05:28:46,889 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:28:46,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:46,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504416279] [2025-03-17 05:28:46,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504416279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:46,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:46,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:28:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197514486] [2025-03-17 05:28:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:46,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:28:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:46,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:28:46,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:46,890 INFO L87 Difference]: Start difference. First operand 292 states and 417 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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:28:52,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:56,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:58,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:02,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:06,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:09,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:10,235 INFO L93 Difference]: Finished difference Result 567 states and 811 transitions. [2025-03-17 05:29:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:29:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 147 [2025-03-17 05:29:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:10,245 INFO L225 Difference]: With dead ends: 567 [2025-03-17 05:29:10,245 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 05:29:10,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:29:10,246 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 147 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:29:10,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 503 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 23.2s Time] [2025-03-17 05:29:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 05:29:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2025-03-17 05:29:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 249 states have (on average 1.3614457831325302) internal successors, (339), 250 states have internal predecessors, (339), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:29:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 415 transitions. [2025-03-17 05:29:10,264 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 415 transitions. Word has length 147 [2025-03-17 05:29:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:10,265 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 415 transitions. [2025-03-17 05:29:10,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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:29:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 415 transitions. [2025-03-17 05:29:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:29:10,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:10,267 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, 1, 1] [2025-03-17 05:29:10,285 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:29:10,467 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:29:10,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1188937467, now seen corresponding path program 1 times [2025-03-17 05:29:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:29:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557493581] [2025-03-17 05:29:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:10,468 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:29:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:29:10,470 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:29:10,471 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:29:10,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:29:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:29:10,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:10,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:29:10,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:29:11,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:29:11,218 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 175 treesize of output 67 [2025-03-17 05:29:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 05:29:11,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:29:11,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:29:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557493581] [2025-03-17 05:29:11,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557493581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:29:11,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:29:11,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:29:11,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408196704] [2025-03-17 05:29:11,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:29:11,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:29:11,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:29:11,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:29:11,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:29:11,248 INFO L87 Difference]: Start difference. First operand 292 states and 415 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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:29:13,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:17,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:18,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:20,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:24,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:25,793 INFO L93 Difference]: Finished difference Result 560 states and 797 transitions. [2025-03-17 05:29:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:29:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 149 [2025-03-17 05:29:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:25,802 INFO L225 Difference]: With dead ends: 560 [2025-03-17 05:29:25,802 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 05:29:25,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:29:25,803 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 139 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:29:25,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 499 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2025-03-17 05:29:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 05:29:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2025-03-17 05:29:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 249 states have (on average 1.3534136546184738) internal successors, (337), 250 states have internal predecessors, (337), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:29:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 413 transitions. [2025-03-17 05:29:25,818 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 413 transitions. Word has length 149 [2025-03-17 05:29:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:25,818 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 413 transitions. [2025-03-17 05:29:25,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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:29:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 413 transitions. [2025-03-17 05:29:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:29:25,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:29:25,837 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:29:26,020 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:29:26,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash -634255320, now seen corresponding path program 1 times [2025-03-17 05:29:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:29:26,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121542373] [2025-03-17 05:29:26,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:26,022 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:29:26,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:29:26,024 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:29:26,024 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:29:26,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:29:26,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:29:26,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:26,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:26,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:29:26,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:29:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 05:29:26,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:29:26,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:29:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121542373] [2025-03-17 05:29:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121542373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:29:26,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:29:26,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:29:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165258654] [2025-03-17 05:29:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:29:26,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:29:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:29:26,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:29:26,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:29:26,562 INFO L87 Difference]: Start difference. First operand 292 states and 413 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:29:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:27,035 INFO L93 Difference]: Finished difference Result 569 states and 804 transitions. [2025-03-17 05:29:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:29:27,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-03-17 05:29:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:27,038 INFO L225 Difference]: With dead ends: 569 [2025-03-17 05:29:27,038 INFO L226 Difference]: Without dead ends: 300 [2025-03-17 05:29:27,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:29:27,039 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:29:27,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 662 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:29:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-17 05:29:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 292. [2025-03-17 05:29:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 250 states have internal predecessors, (335), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:29:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2025-03-17 05:29:27,058 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 151 [2025-03-17 05:29:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:27,059 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2025-03-17 05:29:27,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:29:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2025-03-17 05:29:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:29:27,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:27,061 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, 1, 1, 1, 1] [2025-03-17 05:29:27,079 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:29:27,261 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:29:27,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash 189426151, now seen corresponding path program 1 times [2025-03-17 05:29:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:29:27,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080179457] [2025-03-17 05:29:27,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:27,263 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:29:27,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:29:27,266 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:29:27,267 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:29:27,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:29:27,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:29:27,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:27,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:27,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:29:27,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:29:28,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:29:28,118 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 173 treesize of output 65 [2025-03-17 05:29:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:29:28,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:29:28,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:29:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080179457] [2025-03-17 05:29:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080179457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:29:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:29:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:29:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523946050] [2025-03-17 05:29:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:29:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:29:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:29:28,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:29:28,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:29:28,171 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:29:33,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:35,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:39,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:42,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:42,585 INFO L93 Difference]: Finished difference Result 553 states and 780 transitions. [2025-03-17 05:29:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:29:42,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 151 [2025-03-17 05:29:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:42,595 INFO L225 Difference]: With dead ends: 553 [2025-03-17 05:29:42,595 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 05:29:42,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:29:42,596 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 129 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:29:42,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 491 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 14.3s Time] [2025-03-17 05:29:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 05:29:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2025-03-17 05:29:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 250 states have internal predecessors, (333), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:29:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 409 transitions. [2025-03-17 05:29:42,610 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 409 transitions. Word has length 151 [2025-03-17 05:29:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 409 transitions. [2025-03-17 05:29:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:29:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 409 transitions. [2025-03-17 05:29:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:29:42,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:42,612 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, 1, 1, 1, 1, 1, 1] [2025-03-17 05:29:42,630 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:29:42,813 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:29:42,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:42,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1781444219, now seen corresponding path program 1 times [2025-03-17 05:29:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:29:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655705718] [2025-03-17 05:29:42,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:42,814 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:29:42,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:29:42,816 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:29:42,816 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:29:42,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:29:43,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:29:43,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:43,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:43,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:29:43,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:29:44,087 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:29:45,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:29:45,563 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 190 treesize of output 100 [2025-03-17 05:29:45,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:29:45,840 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 292 treesize of output 100 [2025-03-17 05:29:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-17 05:29:46,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:29:46,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:29:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655705718] [2025-03-17 05:29:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655705718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:29:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [302228340] [2025-03-17 05:29:46,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:46,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:29:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:29:46,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:29:46,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 05:29:47,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:29:50,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:29:50,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:50,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:50,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:29:50,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:29:51,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17