./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-ap_file-34.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 efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:16:04,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:16:04,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:16:04,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:16:04,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:16:04,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:16:04,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:16:04,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:16:04,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:16:04,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:16:04,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:16:04,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:16:04,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:16:04,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:16:04,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:16:04,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:16:04,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:16:04,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:04,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:16:04,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:16:04,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:16:04,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:16:04,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:16:04,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:16:04,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:16:04,623 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 -> efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f [2025-03-04 01:16:04,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:16:04,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:16:04,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:16:04,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:16:04,835 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:16:04,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2025-03-04 01:16:05,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0765fbb1/73432b19ff9048b7afda78685764c7fc/FLAG6cc17589b [2025-03-04 01:16:06,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:16:06,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2025-03-04 01:16:06,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0765fbb1/73432b19ff9048b7afda78685764c7fc/FLAG6cc17589b [2025-03-04 01:16:06,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0765fbb1/73432b19ff9048b7afda78685764c7fc [2025-03-04 01:16:06,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:16:06,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:16:06,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:06,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:16:06,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:16:06,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b277b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06, skipping insertion in model container [2025-03-04 01:16:06,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:16:06,639 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-ap_file-34.i[917,930] [2025-03-04 01:16:06,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:06,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:16:06,695 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-ap_file-34.i[917,930] [2025-03-04 01:16:06,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:06,736 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:16:06,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06 WrapperNode [2025-03-04 01:16:06,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:06,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:06,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:16:06,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:16:06,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,772 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2025-03-04 01:16:06,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:06,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:16:06,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:16:06,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:16:06,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,811 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2025-03-04 01:16:06,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:16:06,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:16:06,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:16:06,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:16:06,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (1/1) ... [2025-03-04 01:16:06,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:06,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:06,859 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-04 01:16:06,861 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-04 01:16:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:16:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:16:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:16:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:16:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:16:06,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:16:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:16:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:16:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:16:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:16:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:16:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:16:06,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:16:07,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:16:07,002 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:16:07,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~short89#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~ite110#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short118#1; [2025-03-04 01:16:07,433 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-04 01:16:07,433 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:16:07,448 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:16:07,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:16:07,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:07 BoogieIcfgContainer [2025-03-04 01:16:07,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:16:07,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:16:07,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:16:07,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:16:07,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:16:06" (1/3) ... [2025-03-04 01:16:07,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5a2b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:07, skipping insertion in model container [2025-03-04 01:16:07,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:06" (2/3) ... [2025-03-04 01:16:07,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5a2b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:07, skipping insertion in model container [2025-03-04 01:16:07,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:07" (3/3) ... [2025-03-04 01:16:07,457 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-34.i [2025-03-04 01:16:07,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:16:07,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:16:07,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:16:07,516 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;@7e7e2ac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:16:07,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:16:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:16:07,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:07,528 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:07,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:07,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 855180355, now seen corresponding path program 1 times [2025-03-04 01:16:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:07,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139146689] [2025-03-04 01:16:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:07,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:16:07,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:16:07,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:07,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 01:16:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139146689] [2025-03-04 01:16:07,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139146689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:07,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808520485] [2025-03-04 01:16:07,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:07,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:07,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:07,833 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-04 01:16:07,835 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-04 01:16:07,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:16:08,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:16:08,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:08,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:08,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:16:08,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 01:16:08,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808520485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:16:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557323627] [2025-03-04 01:16:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:16:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:08,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:16:08,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:16:08,108 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:16:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:08,129 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-03-04 01:16:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:16:08,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-03-04 01:16:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:08,136 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:16:08,136 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:16:08,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-04 01:16:08,142 INFO L435 NwaCegarLoop]: 168 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, 168 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-04 01:16:08,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:16:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:16:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-03-04 01:16:08,171 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-03-04 01:16:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:08,171 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-03-04 01:16:08,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:16:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-03-04 01:16:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:16:08,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:08,173 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:08,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:16:08,374 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-04 01:16:08,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2030050746, now seen corresponding path program 1 times [2025-03-04 01:16:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432053221] [2025-03-04 01:16:08,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:08,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:16:08,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:16:08,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:08,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:16:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432053221] [2025-03-04 01:16:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432053221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833993486] [2025-03-04 01:16:08,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:08,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:08,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:08,765 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-04 01:16:08,770 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-04 01:16:08,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:16:08,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:16:08,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:08,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:08,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:16:08,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:09,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833993486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:09,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:16:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157406945] [2025-03-04 01:16:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:16:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:09,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:16:09,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:16:09,009 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:09,049 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2025-03-04 01:16:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-03-04 01:16:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:09,053 INFO L225 Difference]: With dead ends: 231 [2025-03-04 01:16:09,053 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:16:09,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 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-04 01:16:09,054 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:09,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:16:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 01:16:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-03-04 01:16:09,070 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2025-03-04 01:16:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:09,072 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-03-04 01:16:09,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-03-04 01:16:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 01:16:09,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:09,075 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:09,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:16:09,275 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,SelfDestructingSolverStorable1 [2025-03-04 01:16:09,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2105828638, now seen corresponding path program 1 times [2025-03-04 01:16:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314696640] [2025-03-04 01:16:09,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:09,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 01:16:09,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 01:16:09,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:09,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314696640] [2025-03-04 01:16:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314696640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110972576] [2025-03-04 01:16:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:16:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:09,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:16:09,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:09,419 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:09,451 INFO L93 Difference]: Finished difference Result 282 states and 408 transitions. [2025-03-04 01:16:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:16:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-03-04 01:16:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:09,453 INFO L225 Difference]: With dead ends: 282 [2025-03-04 01:16:09,454 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 01:16:09,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:09,457 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:09,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 01:16:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2025-03-04 01:16:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2025-03-04 01:16:09,468 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 173 [2025-03-04 01:16:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:09,469 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2025-03-04 01:16:09,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2025-03-04 01:16:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:16:09,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:09,473 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:09,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:16:09,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2138667305, now seen corresponding path program 1 times [2025-03-04 01:16:09,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:09,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978236919] [2025-03-04 01:16:09,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:09,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:16:09,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:16:09,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:09,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978236919] [2025-03-04 01:16:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978236919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:09,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:09,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623734758] [2025-03-04 01:16:09,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:16:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:09,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:16:09,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:09,611 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:09,638 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2025-03-04 01:16:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:16:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-04 01:16:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:09,641 INFO L225 Difference]: With dead ends: 297 [2025-03-04 01:16:09,642 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 01:16:09,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:09,643 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 61 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:09,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 01:16:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2025-03-04 01:16:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-03-04 01:16:09,656 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 176 [2025-03-04 01:16:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:09,657 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-03-04 01:16:09,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-03-04 01:16:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:16:09,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:09,659 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:09,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:16:09,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1638320619, now seen corresponding path program 1 times [2025-03-04 01:16:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300749235] [2025-03-04 01:16:09,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:09,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:16:09,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:16:09,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:09,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300749235] [2025-03-04 01:16:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300749235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417925668] [2025-03-04 01:16:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:16:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:09,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:16:09,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:09,772 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:09,788 INFO L93 Difference]: Finished difference Result 270 states and 387 transitions. [2025-03-04 01:16:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:16:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-04 01:16:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:09,790 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:16:09,791 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:16:09,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:09,792 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:09,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:16:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 01:16:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 112 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2025-03-04 01:16:09,805 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 176 [2025-03-04 01:16:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:09,805 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2025-03-04 01:16:09,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2025-03-04 01:16:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:16:09,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:09,807 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:16:09,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1344917612, now seen corresponding path program 1 times [2025-03-04 01:16:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916371136] [2025-03-04 01:16:09,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:16:09,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:16:09,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:09,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916371136] [2025-03-04 01:16:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916371136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:10,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:16:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799671342] [2025-03-04 01:16:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:16:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:10,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:16:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:10,459 INFO L87 Difference]: Start difference. First operand 137 states and 195 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:11,038 INFO L93 Difference]: Finished difference Result 484 states and 688 transitions. [2025-03-04 01:16:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2025-03-04 01:16:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:11,041 INFO L225 Difference]: With dead ends: 484 [2025-03-04 01:16:11,041 INFO L226 Difference]: Without dead ends: 350 [2025-03-04 01:16:11,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:16:11,043 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 535 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:11,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 712 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-04 01:16:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2025-03-04 01:16:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 280 states have (on average 1.3107142857142857) internal successors, (367), 281 states have internal predecessors, (367), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:16:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 489 transitions. [2025-03-04 01:16:11,071 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 489 transitions. Word has length 176 [2025-03-04 01:16:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:11,072 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 489 transitions. [2025-03-04 01:16:11,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 489 transitions. [2025-03-04 01:16:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:16:11,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:11,074 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:11,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:16:11,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash -628241223, now seen corresponding path program 1 times [2025-03-04 01:16:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135209342] [2025-03-04 01:16:11,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:16:11,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:16:11,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135209342] [2025-03-04 01:16:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135209342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:16:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127146539] [2025-03-04 01:16:11,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:11,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:11,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:16:11,308 INFO L87 Difference]: Start difference. First operand 345 states and 489 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:11,476 INFO L93 Difference]: Finished difference Result 949 states and 1348 transitions. [2025-03-04 01:16:11,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:11,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-04 01:16:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:11,484 INFO L225 Difference]: With dead ends: 949 [2025-03-04 01:16:11,485 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 01:16:11,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:11,486 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 237 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:11,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 486 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 01:16:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 601. [2025-03-04 01:16:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 488 states have (on average 1.3135245901639345) internal successors, (641), 489 states have internal predecessors, (641), 107 states have call successors, (107), 5 states have call predecessors, (107), 5 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 01:16:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 855 transitions. [2025-03-04 01:16:11,531 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 855 transitions. Word has length 178 [2025-03-04 01:16:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:11,532 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 855 transitions. [2025-03-04 01:16:11,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 855 transitions. [2025-03-04 01:16:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:16:11,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:11,534 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:11,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:16:11,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:11,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash 333372794, now seen corresponding path program 1 times [2025-03-04 01:16:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834596375] [2025-03-04 01:16:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:16:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:16:11,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:11,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:12,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:12,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834596375] [2025-03-04 01:16:12,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834596375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:12,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:12,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:12,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650010407] [2025-03-04 01:16:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:12,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:12,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:12,101 INFO L87 Difference]: Start difference. First operand 601 states and 855 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:12,710 INFO L93 Difference]: Finished difference Result 1203 states and 1708 transitions. [2025-03-04 01:16:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:16:12,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2025-03-04 01:16:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:12,713 INFO L225 Difference]: With dead ends: 1203 [2025-03-04 01:16:12,714 INFO L226 Difference]: Without dead ends: 605 [2025-03-04 01:16:12,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:16:12,715 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 486 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:12,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 844 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-04 01:16:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 473. [2025-03-04 01:16:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 384 states have (on average 1.3125) internal successors, (504), 385 states have internal predecessors, (504), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:16:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 672 transitions. [2025-03-04 01:16:12,762 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 672 transitions. Word has length 178 [2025-03-04 01:16:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:12,762 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 672 transitions. [2025-03-04 01:16:12,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 672 transitions. [2025-03-04 01:16:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 01:16:12,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:12,763 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:12,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:16:12,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -276444850, now seen corresponding path program 1 times [2025-03-04 01:16:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644562374] [2025-03-04 01:16:12,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:16:12,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:16:12,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:12,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:13,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644562374] [2025-03-04 01:16:13,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644562374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:13,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397084615] [2025-03-04 01:16:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:13,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:13,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:13,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:13,470 INFO L87 Difference]: Start difference. First operand 473 states and 672 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:13,890 INFO L93 Difference]: Finished difference Result 1154 states and 1625 transitions. [2025-03-04 01:16:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 179 [2025-03-04 01:16:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:13,894 INFO L225 Difference]: With dead ends: 1154 [2025-03-04 01:16:13,894 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 01:16:13,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:13,896 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 293 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:13,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 957 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 01:16:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 675. [2025-03-04 01:16:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 549 states have (on average 1.296903460837887) internal successors, (712), 553 states have internal predecessors, (712), 117 states have call successors, (117), 8 states have call predecessors, (117), 8 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-04 01:16:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 946 transitions. [2025-03-04 01:16:13,943 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 946 transitions. Word has length 179 [2025-03-04 01:16:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:13,944 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 946 transitions. [2025-03-04 01:16:13,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 946 transitions. [2025-03-04 01:16:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:13,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:13,948 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:13,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:16:13,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:13,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1670336742, now seen corresponding path program 1 times [2025-03-04 01:16:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:13,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661343423] [2025-03-04 01:16:13,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:13,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:13,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:14,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661343423] [2025-03-04 01:16:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661343423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:14,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:16:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862226656] [2025-03-04 01:16:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:14,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:16:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:14,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:16:14,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:16:14,152 INFO L87 Difference]: Start difference. First operand 675 states and 946 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:14,351 INFO L93 Difference]: Finished difference Result 1506 states and 2110 transitions. [2025-03-04 01:16:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:14,356 INFO L225 Difference]: With dead ends: 1506 [2025-03-04 01:16:14,357 INFO L226 Difference]: Without dead ends: 834 [2025-03-04 01:16:14,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 01:16:14,359 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:14,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 441 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-04 01:16:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 734. [2025-03-04 01:16:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 584 states have (on average 1.2842465753424657) internal successors, (750), 588 states have internal predecessors, (750), 140 states have call successors, (140), 9 states have call predecessors, (140), 9 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:16:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1030 transitions. [2025-03-04 01:16:14,433 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1030 transitions. Word has length 180 [2025-03-04 01:16:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:14,433 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1030 transitions. [2025-03-04 01:16:14,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1030 transitions. [2025-03-04 01:16:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:14,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:14,435 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:14,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:16:14,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 114114623, now seen corresponding path program 1 times [2025-03-04 01:16:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479715529] [2025-03-04 01:16:14,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:14,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:14,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:14,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:14,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:14,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479715529] [2025-03-04 01:16:14,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479715529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:14,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:14,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311282938] [2025-03-04 01:16:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:14,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:14,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:14,743 INFO L87 Difference]: Start difference. First operand 734 states and 1030 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:14,868 INFO L93 Difference]: Finished difference Result 1596 states and 2232 transitions. [2025-03-04 01:16:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:14,873 INFO L225 Difference]: With dead ends: 1596 [2025-03-04 01:16:14,874 INFO L226 Difference]: Without dead ends: 924 [2025-03-04 01:16:14,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:14,877 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 34 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:14,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 732 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-04 01:16:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 761. [2025-03-04 01:16:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 611 states have (on average 1.2831423895253682) internal successors, (784), 615 states have internal predecessors, (784), 140 states have call successors, (140), 9 states have call predecessors, (140), 9 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:16:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1064 transitions. [2025-03-04 01:16:14,932 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1064 transitions. Word has length 180 [2025-03-04 01:16:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:14,932 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1064 transitions. [2025-03-04 01:16:14,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1064 transitions. [2025-03-04 01:16:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:14,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:14,935 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:14,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:16:14,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1682836736, now seen corresponding path program 1 times [2025-03-04 01:16:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050865816] [2025-03-04 01:16:14,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:14,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:14,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:14,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:14,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:15,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:15,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050865816] [2025-03-04 01:16:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050865816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:15,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305755685] [2025-03-04 01:16:15,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:15,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:15,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:15,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:15,665 INFO L87 Difference]: Start difference. First operand 761 states and 1064 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:16,143 INFO L93 Difference]: Finished difference Result 1897 states and 2624 transitions. [2025-03-04 01:16:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:16:16,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-03-04 01:16:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:16,149 INFO L225 Difference]: With dead ends: 1897 [2025-03-04 01:16:16,149 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 01:16:16,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:16,151 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 356 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:16,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 606 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 01:16:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1189. [2025-03-04 01:16:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 990 states have (on average 1.2808080808080808) internal successors, (1268), 1001 states have internal predecessors, (1268), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1632 transitions. [2025-03-04 01:16:16,247 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1632 transitions. Word has length 180 [2025-03-04 01:16:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:16,248 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1632 transitions. [2025-03-04 01:16:16,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1632 transitions. [2025-03-04 01:16:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:16,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:16,250 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:16,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:16:16,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:16,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1393437186, now seen corresponding path program 1 times [2025-03-04 01:16:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819765268] [2025-03-04 01:16:16,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:16,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:16,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:16,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:16,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:17,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819765268] [2025-03-04 01:16:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819765268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:17,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:17,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:16:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408374010] [2025-03-04 01:16:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:17,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:16:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:17,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:16:17,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:16:17,641 INFO L87 Difference]: Start difference. First operand 1189 states and 1632 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:16:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:18,393 INFO L93 Difference]: Finished difference Result 2910 states and 3960 transitions. [2025-03-04 01:16:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:16:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180 [2025-03-04 01:16:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:18,403 INFO L225 Difference]: With dead ends: 2910 [2025-03-04 01:16:18,403 INFO L226 Difference]: Without dead ends: 1783 [2025-03-04 01:16:18,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:16:18,407 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 381 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:18,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1209 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-04 01:16:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1501. [2025-03-04 01:16:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1302 states have (on average 1.2795698924731183) internal successors, (1666), 1313 states have internal predecessors, (1666), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2030 transitions. [2025-03-04 01:16:18,508 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2030 transitions. Word has length 180 [2025-03-04 01:16:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:18,509 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2030 transitions. [2025-03-04 01:16:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:16:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2030 transitions. [2025-03-04 01:16:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:18,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:18,512 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:18,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:16:18,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1104578751, now seen corresponding path program 1 times [2025-03-04 01:16:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592773274] [2025-03-04 01:16:18,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:18,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:18,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:18,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:18,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592773274] [2025-03-04 01:16:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592773274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:18,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231991442] [2025-03-04 01:16:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:18,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:18,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:18,743 INFO L87 Difference]: Start difference. First operand 1501 states and 2030 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:18,898 INFO L93 Difference]: Finished difference Result 3222 states and 4352 transitions. [2025-03-04 01:16:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:18,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:18,907 INFO L225 Difference]: With dead ends: 3222 [2025-03-04 01:16:18,907 INFO L226 Difference]: Without dead ends: 1783 [2025-03-04 01:16:18,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:18,910 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 38 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:18,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 734 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-04 01:16:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1501. [2025-03-04 01:16:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1302 states have (on average 1.2596006144393241) internal successors, (1640), 1313 states have internal predecessors, (1640), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2004 transitions. [2025-03-04 01:16:19,011 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2004 transitions. Word has length 180 [2025-03-04 01:16:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:19,012 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2004 transitions. [2025-03-04 01:16:19,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2004 transitions. [2025-03-04 01:16:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:19,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:19,013 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:19,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:16:19,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:19,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash 811175744, now seen corresponding path program 1 times [2025-03-04 01:16:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548658001] [2025-03-04 01:16:19,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:19,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:19,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:19,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:19,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548658001] [2025-03-04 01:16:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548658001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:19,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:19,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:16:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925667474] [2025-03-04 01:16:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:19,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:16:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:19,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:16:19,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:19,383 INFO L87 Difference]: Start difference. First operand 1501 states and 2004 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:16:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:19,719 INFO L93 Difference]: Finished difference Result 3808 states and 5038 transitions. [2025-03-04 01:16:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-04 01:16:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:19,728 INFO L225 Difference]: With dead ends: 3808 [2025-03-04 01:16:19,728 INFO L226 Difference]: Without dead ends: 2369 [2025-03-04 01:16:19,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:16:19,731 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 358 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:19,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 485 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-04 01:16:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2015. [2025-03-04 01:16:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1816 states have (on average 1.2599118942731278) internal successors, (2288), 1827 states have internal predecessors, (2288), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2652 transitions. [2025-03-04 01:16:19,855 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2652 transitions. Word has length 180 [2025-03-04 01:16:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2652 transitions. [2025-03-04 01:16:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:16:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2652 transitions. [2025-03-04 01:16:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:19,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:19,857 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:16:19,858 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:19,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 824320767, now seen corresponding path program 1 times [2025-03-04 01:16:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006610516] [2025-03-04 01:16:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:19,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006610516] [2025-03-04 01:16:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006610516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:20,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:20,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:20,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554252555] [2025-03-04 01:16:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:20,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:20,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:20,039 INFO L87 Difference]: Start difference. First operand 2015 states and 2652 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:20,172 INFO L93 Difference]: Finished difference Result 3869 states and 5096 transitions. [2025-03-04 01:16:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:16:20,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:20,181 INFO L225 Difference]: With dead ends: 3869 [2025-03-04 01:16:20,181 INFO L226 Difference]: Without dead ends: 1916 [2025-03-04 01:16:20,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:20,184 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 21 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 597 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-04 01:16:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2025-03-04 01:16:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1717 states have (on average 1.2597553873034362) internal successors, (2163), 1728 states have internal predecessors, (2163), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2527 transitions. [2025-03-04 01:16:20,270 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2527 transitions. Word has length 180 [2025-03-04 01:16:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:20,270 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2527 transitions. [2025-03-04 01:16:20,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2527 transitions. [2025-03-04 01:16:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:20,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:20,272 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:20,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:16:20,273 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:20,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1772789761, now seen corresponding path program 1 times [2025-03-04 01:16:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320745301] [2025-03-04 01:16:20,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:20,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:20,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:20,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:20,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320745301] [2025-03-04 01:16:20,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320745301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:20,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:16:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503143029] [2025-03-04 01:16:20,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:20,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:16:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:20,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:16:20,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:16:20,344 INFO L87 Difference]: Start difference. First operand 1916 states and 2527 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:20,415 INFO L93 Difference]: Finished difference Result 3530 states and 4653 transitions. [2025-03-04 01:16:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:20,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:20,422 INFO L225 Difference]: With dead ends: 3530 [2025-03-04 01:16:20,422 INFO L226 Difference]: Without dead ends: 1676 [2025-03-04 01:16:20,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:16:20,425 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:20,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 483 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-03-04 01:16:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1676. [2025-03-04 01:16:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1477 states have (on average 1.2450914014895058) internal successors, (1839), 1488 states have internal predecessors, (1839), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2203 transitions. [2025-03-04 01:16:20,509 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2203 transitions. Word has length 180 [2025-03-04 01:16:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2203 transitions. [2025-03-04 01:16:20,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2203 transitions. [2025-03-04 01:16:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:20,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:20,512 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:16:20,512 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1785934784, now seen corresponding path program 1 times [2025-03-04 01:16:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815452250] [2025-03-04 01:16:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:20,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:20,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:20,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:20,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815452250] [2025-03-04 01:16:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815452250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:16:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199584460] [2025-03-04 01:16:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:16:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:20,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:16:20,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:16:20,839 INFO L87 Difference]: Start difference. First operand 1676 states and 2203 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:21,101 INFO L93 Difference]: Finished difference Result 3601 states and 4729 transitions. [2025-03-04 01:16:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:16:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:21,108 INFO L225 Difference]: With dead ends: 3601 [2025-03-04 01:16:21,109 INFO L226 Difference]: Without dead ends: 1987 [2025-03-04 01:16:21,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:21,112 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 163 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:21,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 648 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-04 01:16:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1714. [2025-03-04 01:16:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1515 states have (on average 1.2363036303630364) internal successors, (1873), 1526 states have internal predecessors, (1873), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2237 transitions. [2025-03-04 01:16:21,188 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2237 transitions. Word has length 180 [2025-03-04 01:16:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:21,189 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2237 transitions. [2025-03-04 01:16:21,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2237 transitions. [2025-03-04 01:16:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:21,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:21,190 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:21,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:16:21,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:21,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:21,191 INFO L85 PathProgramCache]: Analyzing trace with hash -304419582, now seen corresponding path program 1 times [2025-03-04 01:16:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838010907] [2025-03-04 01:16:21,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:21,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:21,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:21,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:21,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:21,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838010907] [2025-03-04 01:16:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838010907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:21,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128556909] [2025-03-04 01:16:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:21,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:21,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:21,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:21,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:21,576 INFO L87 Difference]: Start difference. First operand 1714 states and 2237 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:21,779 INFO L93 Difference]: Finished difference Result 3678 states and 4795 transitions. [2025-03-04 01:16:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:21,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:21,786 INFO L225 Difference]: With dead ends: 3678 [2025-03-04 01:16:21,786 INFO L226 Difference]: Without dead ends: 2026 [2025-03-04 01:16:21,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:21,790 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 57 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:21,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1751 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2025-03-04 01:16:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1744. [2025-03-04 01:16:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1545 states have (on average 1.231715210355987) internal successors, (1903), 1556 states have internal predecessors, (1903), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2267 transitions. [2025-03-04 01:16:21,908 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2267 transitions. Word has length 180 [2025-03-04 01:16:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:21,908 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2267 transitions. [2025-03-04 01:16:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2267 transitions. [2025-03-04 01:16:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:21,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:21,910 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:16:21,910 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash -989735039, now seen corresponding path program 1 times [2025-03-04 01:16:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537583945] [2025-03-04 01:16:21,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:21,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:21,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:21,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:21,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537583945] [2025-03-04 01:16:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537583945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:22,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:22,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187415589] [2025-03-04 01:16:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:22,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:22,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:22,139 INFO L87 Difference]: Start difference. First operand 1744 states and 2267 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:22,283 INFO L93 Difference]: Finished difference Result 3245 states and 4225 transitions. [2025-03-04 01:16:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:22,289 INFO L225 Difference]: With dead ends: 3245 [2025-03-04 01:16:22,290 INFO L226 Difference]: Without dead ends: 1563 [2025-03-04 01:16:22,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:22,293 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 65 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:22,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 848 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-04 01:16:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2025-03-04 01:16:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1362 states have (on average 1.2290748898678414) internal successors, (1674), 1373 states have internal predecessors, (1674), 182 states have call successors, (182), 16 states have call predecessors, (182), 16 states have return successors, (182), 171 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 01:16:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2038 transitions. [2025-03-04 01:16:22,372 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2038 transitions. Word has length 180 [2025-03-04 01:16:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:22,374 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2038 transitions. [2025-03-04 01:16:22,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2038 transitions. [2025-03-04 01:16:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:22,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:22,376 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:16:22,376 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:22,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1517422464, now seen corresponding path program 1 times [2025-03-04 01:16:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994584527] [2025-03-04 01:16:22,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:22,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994584527] [2025-03-04 01:16:22,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994584527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:16:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023335099] [2025-03-04 01:16:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:22,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:16:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:22,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:16:22,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:22,839 INFO L87 Difference]: Start difference. First operand 1561 states and 2038 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:23,205 INFO L93 Difference]: Finished difference Result 3056 states and 3973 transitions. [2025-03-04 01:16:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:16:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-03-04 01:16:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:23,211 INFO L225 Difference]: With dead ends: 3056 [2025-03-04 01:16:23,212 INFO L226 Difference]: Without dead ends: 1557 [2025-03-04 01:16:23,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:16:23,215 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 411 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:23,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 695 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-04 01:16:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1277. [2025-03-04 01:16:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1119 states have (on average 1.2198391420911527) internal successors, (1365), 1123 states have internal predecessors, (1365), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:16:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1645 transitions. [2025-03-04 01:16:23,279 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1645 transitions. Word has length 180 [2025-03-04 01:16:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:23,279 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1645 transitions. [2025-03-04 01:16:23,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1645 transitions. [2025-03-04 01:16:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 01:16:23,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:23,281 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:23,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:16:23,281 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1091105771, now seen corresponding path program 1 times [2025-03-04 01:16:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:23,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728195520] [2025-03-04 01:16:23,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:23,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:16:23,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:16:23,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:23,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:16:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728195520] [2025-03-04 01:16:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728195520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47649831] [2025-03-04 01:16:23,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:23,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:23,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:16:23,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:16:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:16:23,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:16:23,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:23,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:23,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:16:23,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:23,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:23,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47649831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:23,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:16:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670512129] [2025-03-04 01:16:23,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:23,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:16:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:23,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:16:23,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:23,676 INFO L87 Difference]: Start difference. First operand 1277 states and 1645 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:23,742 INFO L93 Difference]: Finished difference Result 2509 states and 3228 transitions. [2025-03-04 01:16:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:16:23,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-04 01:16:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:23,747 INFO L225 Difference]: With dead ends: 2509 [2025-03-04 01:16:23,747 INFO L226 Difference]: Without dead ends: 1298 [2025-03-04 01:16:23,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:16:23,751 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:23,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-04 01:16:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-03-04 01:16:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1140 states have (on average 1.2157894736842105) internal successors, (1386), 1144 states have internal predecessors, (1386), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:16:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1666 transitions. [2025-03-04 01:16:23,808 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1666 transitions. Word has length 182 [2025-03-04 01:16:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1666 transitions. [2025-03-04 01:16:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1666 transitions. [2025-03-04 01:16:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 01:16:23,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:23,810 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:23,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:16:24,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:24,011 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1407024813, now seen corresponding path program 1 times [2025-03-04 01:16:24,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:24,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785963250] [2025-03-04 01:16:24,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:24,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:16:24,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:16:24,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:24,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785963250] [2025-03-04 01:16:24,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785963250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:24,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:24,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:24,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395443630] [2025-03-04 01:16:24,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:24,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:24,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:24,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:24,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:24,387 INFO L87 Difference]: Start difference. First operand 1298 states and 1666 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:24,718 INFO L93 Difference]: Finished difference Result 1531 states and 1962 transitions. [2025-03-04 01:16:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:16:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 184 [2025-03-04 01:16:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:24,724 INFO L225 Difference]: With dead ends: 1531 [2025-03-04 01:16:24,724 INFO L226 Difference]: Without dead ends: 1529 [2025-03-04 01:16:24,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:16:24,725 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 241 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:24,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1086 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:16:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-03-04 01:16:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1474. [2025-03-04 01:16:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1316 states have (on average 1.2142857142857142) internal successors, (1598), 1320 states have internal predecessors, (1598), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:16:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1878 transitions. [2025-03-04 01:16:24,785 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1878 transitions. Word has length 184 [2025-03-04 01:16:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:24,786 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1878 transitions. [2025-03-04 01:16:24,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:16:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1878 transitions. [2025-03-04 01:16:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 01:16:24,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:24,787 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:16:24,787 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 318456084, now seen corresponding path program 1 times [2025-03-04 01:16:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605770865] [2025-03-04 01:16:24,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:24,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:16:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:16:24,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:24,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:16:24,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:16:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:16:24,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:16:24,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:24,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:16:25,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:16:25,033 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:16:25,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:16:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:16:25,037 INFO L422 BasicCegarLoop]: Path program histogram: [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-04 01:16:25,175 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:16:25,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:16:25 BoogieIcfgContainer [2025-03-04 01:16:25,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:16:25,179 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:16:25,179 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:16:25,179 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:16:25,180 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:07" (3/4) ... [2025-03-04 01:16:25,181 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:16:25,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:16:25,183 INFO L158 Benchmark]: Toolchain (without parser) took 18650.70ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 110.4MB in the beginning and 402.9MB in the end (delta: -292.5MB). Peak memory consumption was 399.8MB. Max. memory is 16.1GB. [2025-03-04 01:16:25,183 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:16:25,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.38ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 95.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:16:25,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:16:25,184 INFO L158 Benchmark]: Boogie Preprocessor took 62.42ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:16:25,184 INFO L158 Benchmark]: IcfgBuilder took 612.46ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 54.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:16:25,185 INFO L158 Benchmark]: TraceAbstraction took 17728.14ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 53.1MB in the beginning and 402.9MB in the end (delta: -349.7MB). Peak memory consumption was 341.1MB. Max. memory is 16.1GB. [2025-03-04 01:16:25,185 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 838.9MB. Free memory is still 402.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:16:25,186 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.99ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.38ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 95.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.42ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 612.46ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 54.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17728.14ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 53.1MB in the beginning and 402.9MB in the end (delta: -349.7MB). Peak memory consumption was 341.1MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 838.9MB. Free memory is still 402.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[0][2]); [L30] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer = &(BOOL_unsigned_char_Array_0[1][2]); [L31-L33] double double_Array_0[2] = { 10.6, 16.6 }; [L31-L33] double double_Array_0[2] = { 10.6, 16.6 }; [L31-L33] double double_Array_0[2] = { 10.6, 16.6 }; [L34] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L35] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L40] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L41] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L42] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[3]); [L43] signed char* signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer = &(signed_char_Array_0[4]); [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L49] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L50] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L115] EXPR BOOL_unsigned_char_Array_0[1][1] [L115] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L78] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L80] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L81] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L83] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L84] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L86] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L87] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L89] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L90] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L92] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L93] double_Array_0[0] = __VERIFIER_nondet_double() [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L95] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L96] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L97] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L97] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L97] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L98] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L99] CALL assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L99] RET assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L100] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L100] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L100] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L101] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L102] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L102] CALL assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L102] RET assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L103] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L103] CALL assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L103] RET assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L104] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L106] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L107] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L109] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L110] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L112] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L126] RET updateVariables() [L127] CALL step() [L54] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L59] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L59] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L59] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L59] COND FALSE !((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L62] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) [L62] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L62] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) [L63] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer) [L63] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L63] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L63] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L63] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L63] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) = (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L67] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L67] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L67] signed long int stepLocal_1 = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1))); [L68] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L68] signed char stepLocal_0 = (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)); [L69] COND FALSE !(-10 >= stepLocal_0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1 [L118] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))))) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1 [L118] EXPR (-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1 [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer) [L118] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118-L119] return (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3916 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3912 mSDsluCounter, 15631 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11614 mSDsCounter, 789 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3731 IncrementalHoareTripleChecker+Invalid, 4520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 789 mSolverCounterUnsat, 4017 mSDtfsCounter, 3731 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 757 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2015occurred in iteration=15, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 2293 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 4812 NumberOfCodeBlocks, 4812 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4602 ConstructedInterpolants, 0 QuantifiedInterpolants, 12133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1836 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 26136/26312 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-04 01:16:25,205 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-ap_file-34.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 efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:16:27,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:16:27,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:16:27,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:16:27,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:16:27,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:16:27,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:16:27,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:16:27,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:16:27,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:16:27,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:16:27,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:16:27,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:16:27,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:16:27,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:16:27,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:16:27,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:27,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:16:27,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:16:27,218 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 -> efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f [2025-03-04 01:16:27,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:16:27,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:16:27,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:16:27,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:16:27,474 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:16:27,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2025-03-04 01:16:28,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbab2dfd/e7bac0caf4de47248586dbda21c0556e/FLAGe9fa88eec [2025-03-04 01:16:28,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:16:28,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2025-03-04 01:16:28,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbab2dfd/e7bac0caf4de47248586dbda21c0556e/FLAGe9fa88eec [2025-03-04 01:16:29,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbab2dfd/e7bac0caf4de47248586dbda21c0556e [2025-03-04 01:16:29,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:16:29,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:16:29,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:29,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:16:29,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:16:29,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9365f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29, skipping insertion in model container [2025-03-04 01:16:29,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:16:29,300 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-ap_file-34.i[917,930] [2025-03-04 01:16:29,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:29,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:16:29,380 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-ap_file-34.i[917,930] [2025-03-04 01:16:29,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:29,427 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:16:29,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29 WrapperNode [2025-03-04 01:16:29,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:29,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:29,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:16:29,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:16:29,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,469 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2025-03-04 01:16:29,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:29,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:16:29,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:16:29,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:16:29,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,496 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2025-03-04 01:16:29,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:16:29,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:16:29,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:16:29,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:16:29,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (1/1) ... [2025-03-04 01:16:29,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:29,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:29,542 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-04 01:16:29,547 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-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:16:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:16:29,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:16:29,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:16:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:16:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:16:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:16:29,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:16:29,687 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:16:45,025 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~short89#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~ite110#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short118#1; [2025-03-04 01:16:45,082 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 01:16:45,082 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:16:45,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:16:45,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:16:45,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:45 BoogieIcfgContainer [2025-03-04 01:16:45,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:16:45,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:16:45,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:16:45,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:16:45,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:16:29" (1/3) ... [2025-03-04 01:16:45,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175bd40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:45, skipping insertion in model container [2025-03-04 01:16:45,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:29" (2/3) ... [2025-03-04 01:16:45,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175bd40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:45, skipping insertion in model container [2025-03-04 01:16:45,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:45" (3/3) ... [2025-03-04 01:16:45,102 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-34.i [2025-03-04 01:16:45,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:16:45,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:16:45,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:16:45,163 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;@b64f508, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:16:45,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:16:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:16:45,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:45,177 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:45,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 855180355, now seen corresponding path program 1 times [2025-03-04 01:16:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212164338] [2025-03-04 01:16:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:45,191 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-04 01:16:45,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:45,194 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-04 01:16:45,196 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-04 01:16:45,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:16:45,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:16:45,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:45,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:45,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:16:45,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 01:16:45,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:45,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212164338] [2025-03-04 01:16:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212164338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:45,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:45,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:16:45,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348947841] [2025-03-04 01:16:45,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:45,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:16:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:45,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:16:45,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:16:45,632 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:16:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:45,660 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-03-04 01:16:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:16:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-03-04 01:16:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:45,667 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:16:45,667 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:16:45,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-04 01:16:45,673 INFO L435 NwaCegarLoop]: 168 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, 168 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-04 01:16:45,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:16:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:16:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-03-04 01:16:45,707 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-03-04 01:16:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:45,707 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-03-04 01:16:45,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:16:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-03-04 01:16:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:16:45,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:45,709 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:45,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:16:45,910 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-04 01:16:45,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:45,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:45,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2030050746, now seen corresponding path program 1 times [2025-03-04 01:16:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:45,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513174255] [2025-03-04 01:16:45,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:45,913 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-04 01:16:45,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:45,916 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-04 01:16:45,918 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-04 01:16:46,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:16:46,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:16:46,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:46,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:16:46,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:46,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:46,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513174255] [2025-03-04 01:16:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513174255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235488487] [2025-03-04 01:16:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:16:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:46,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:16:46,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:46,403 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:46,450 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2025-03-04 01:16:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:16:46,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-03-04 01:16:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:46,452 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:16:46,452 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:16:46,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:46,453 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:46,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:16:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:16:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:16:46,470 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171 [2025-03-04 01:16:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:46,471 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:16:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:16:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 01:16:46,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:46,473 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:46,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:16:46,673 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-04 01:16:46,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:46,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash -188095999, now seen corresponding path program 1 times [2025-03-04 01:16:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563603199] [2025-03-04 01:16:46,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:46,675 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-04 01:16:46,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:46,677 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-04 01:16:46,679 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-04 01:16:46,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 01:16:47,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 01:16:47,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:47,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:16:47,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:47,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:47,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563603199] [2025-03-04 01:16:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563603199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:47,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:47,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:16:47,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916234146] [2025-03-04 01:16:47,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:47,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:16:47,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:47,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:16:47,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:16:47,153 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:47,229 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2025-03-04 01:16:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:47,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-03-04 01:16:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:47,230 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:16:47,231 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:16:47,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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-04 01:16:47,235 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 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-04 01:16:47,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:16:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:16:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:16:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:16:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-04 01:16:47,245 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173 [2025-03-04 01:16:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:47,245 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-04 01:16:47,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-04 01:16:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 01:16:47,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:47,247 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:47,259 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-04 01:16:47,447 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-04 01:16:47,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:47,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1513842723, now seen corresponding path program 1 times [2025-03-04 01:16:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20002724] [2025-03-04 01:16:47,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:47,454 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-04 01:16:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:47,457 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-04 01:16:47,477 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-04 01:16:47,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 01:16:47,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 01:16:47,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:47,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:16:47,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:47,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 01:16:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:48,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:48,869 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20002724] [2025-03-04 01:16:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20002724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:48,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:48,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027085553] [2025-03-04 01:16:48,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:48,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:16:48,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:48,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:16:48,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:16:48,871 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:49,224 INFO L93 Difference]: Finished difference Result 344 states and 494 transitions. [2025-03-04 01:16:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:16:49,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-03-04 01:16:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:49,228 INFO L225 Difference]: With dead ends: 344 [2025-03-04 01:16:49,228 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 01:16:49,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:16:49,229 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 107 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:49,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 436 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 01:16:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 191. [2025-03-04 01:16:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 142 states have internal predecessors, (181), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:16:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2025-03-04 01:16:49,257 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 175 [2025-03-04 01:16:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:49,257 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2025-03-04 01:16:49,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2025-03-04 01:16:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:16:49,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:49,263 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:49,273 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 (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:16:49,463 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-04 01:16:49,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:49,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash -921644230, now seen corresponding path program 1 times [2025-03-04 01:16:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107612213] [2025-03-04 01:16:49,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:49,464 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-04 01:16:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:49,466 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-04 01:16:49,468 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-04 01:16:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:16:49,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:16:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:49,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:49,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:16:49,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:49,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:49,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:49,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107612213] [2025-03-04 01:16:49,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107612213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:49,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:49,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:16:49,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929683318] [2025-03-04 01:16:49,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:49,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:16:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:49,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:16:49,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:49,821 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:49,854 INFO L93 Difference]: Finished difference Result 318 states and 456 transitions. [2025-03-04 01:16:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:16:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-04 01:16:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:49,856 INFO L225 Difference]: With dead ends: 318 [2025-03-04 01:16:49,856 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 01:16:49,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:16:49,857 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:49,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 01:16:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-04 01:16:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:16:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 269 transitions. [2025-03-04 01:16:49,872 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 269 transitions. Word has length 178 [2025-03-04 01:16:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:49,872 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 269 transitions. [2025-03-04 01:16:49,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 269 transitions. [2025-03-04 01:16:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:49,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:49,873 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:49,885 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-04 01:16:50,074 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-04 01:16:50,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 114114623, now seen corresponding path program 1 times [2025-03-04 01:16:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620260095] [2025-03-04 01:16:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:50,075 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-04 01:16:50,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:50,077 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-04 01:16:50,077 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-04 01:16:50,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:50,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:50,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:50,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:50,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:16:50,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:16:50,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:50,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:50,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620260095] [2025-03-04 01:16:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620260095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:50,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:50,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:16:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952715867] [2025-03-04 01:16:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:16:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:16:50,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:16:50,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:16:50,574 INFO L87 Difference]: Start difference. First operand 189 states and 269 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:50,928 INFO L93 Difference]: Finished difference Result 345 states and 489 transitions. [2025-03-04 01:16:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:16:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:50,934 INFO L225 Difference]: With dead ends: 345 [2025-03-04 01:16:50,934 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 01:16:50,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:16:50,935 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 35 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:50,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 711 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 01:16:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2025-03-04 01:16:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 144 states have internal predecessors, (182), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:16:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2025-03-04 01:16:50,948 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 180 [2025-03-04 01:16:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:50,948 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2025-03-04 01:16:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:16:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2025-03-04 01:16:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:16:50,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:50,950 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:16:50,961 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-04 01:16:51,150 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-04 01:16:51,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1682836736, now seen corresponding path program 1 times [2025-03-04 01:16:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:16:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832593193] [2025-03-04 01:16:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:51,151 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-04 01:16:51,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:16:51,153 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-04 01:16:51,154 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-04 01:16:51,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:16:51,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:16:51,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:51,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:51,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:16:51,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:53,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:16:53,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-03-04 01:16:57,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2025-03-04 01:16:57,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:57,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2025-03-04 01:16:57,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2025-03-04 01:16:57,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:16:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 51 [2025-03-04 01:16:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 480 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-04 01:16:58,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:59,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:16:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832593193] [2025-03-04 01:16:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832593193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247727972] [2025-03-04 01:16:59,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:59,555 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:16:59,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:16:59,557 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:16:59,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-04 01:16:59,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:17:00,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:17:00,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:00,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:00,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:17:00,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:01,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:02,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:17:04,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2025-03-04 01:17:04,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:17:04,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2025-03-04 01:17:04,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2025-03-04 01:17:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-04 01:17:05,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1247727972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:05,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2025-03-04 01:17:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821947937] [2025-03-04 01:17:05,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:17:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:17:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:05,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:17:05,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:17:05,994 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand has 19 states, 18 states have (on average 7.5) internal successors, (135), 17 states have internal predecessors, (135), 6 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2025-03-04 01:17:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:10,313 INFO L93 Difference]: Finished difference Result 419 states and 582 transitions. [2025-03-04 01:17:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:17:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 7.5) internal successors, (135), 17 states have internal predecessors, (135), 6 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) Word has length 180 [2025-03-04 01:17:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:10,316 INFO L225 Difference]: With dead ends: 419 [2025-03-04 01:17:10,317 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 01:17:10,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 592 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=414, Invalid=1308, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 01:17:10,319 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 942 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:10,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1076 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 01:17:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 01:17:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2025-03-04 01:17:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.2811059907834101) internal successors, (278), 218 states have internal predecessors, (278), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:17:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 382 transitions. [2025-03-04 01:17:10,344 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 382 transitions. Word has length 180 [2025-03-04 01:17:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:10,346 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 382 transitions. [2025-03-04 01:17:10,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 7.5) internal successors, (135), 17 states have internal predecessors, (135), 6 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2025-03-04 01:17:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 382 transitions. [2025-03-04 01:17:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:17:10,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:10,348 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:17:10,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:10,562 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-04 01:17:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-04 01:17:10,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1393437186, now seen corresponding path program 1 times [2025-03-04 01:17:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186578836] [2025-03-04 01:17:10,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:10,750 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-04 01:17:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:10,751 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-04 01:17:10,752 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-04 01:17:10,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:17:11,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:17:11,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:11,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:11,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:17:11,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:11,729 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-04 01:17:12,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-04 01:17:12,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2025-03-04 01:17:16,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-03-04 01:17:16,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:16,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2025-03-04 01:17:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 68 proven. 492 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-03-04 01:17:17,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:17:18,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186578836] [2025-03-04 01:17:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186578836] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:18,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 24 [2025-03-04 01:17:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491843440] [2025-03-04 01:17:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:18,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:17:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:18,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:17:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:17:18,457 INFO L87 Difference]: Start difference. First operand 275 states and 382 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:17:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:19,505 INFO L93 Difference]: Finished difference Result 598 states and 829 transitions. [2025-03-04 01:17:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:17:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:17:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:19,509 INFO L225 Difference]: With dead ends: 598 [2025-03-04 01:17:19,509 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 01:17:19,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:17:19,511 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 53 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:19,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1138 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:17:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 01:17:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 341. [2025-03-04 01:17:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.303886925795053) internal successors, (369), 284 states have internal predecessors, (369), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:17:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 473 transitions. [2025-03-04 01:17:19,536 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 473 transitions. Word has length 180 [2025-03-04 01:17:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:19,537 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 473 transitions. [2025-03-04 01:17:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:17:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 473 transitions. [2025-03-04 01:17:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:17:19,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:19,539 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:17:19,554 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-04 01:17:19,739 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-04 01:17:19,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1104578751, now seen corresponding path program 1 times [2025-03-04 01:17:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731772586] [2025-03-04 01:17:19,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:19,742 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-04 01:17:19,743 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-04 01:17:19,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:17:20,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:17:20,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:20,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:20,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:17:20,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:17:20,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:20,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731772586] [2025-03-04 01:17:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731772586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:20,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:17:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33474152] [2025-03-04 01:17:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:17:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:20,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:17:20,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:20,239 INFO L87 Difference]: Start difference. First operand 341 states and 473 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:17:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:20,567 INFO L93 Difference]: Finished difference Result 658 states and 911 transitions. [2025-03-04 01:17:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:17:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:17:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:20,573 INFO L225 Difference]: With dead ends: 658 [2025-03-04 01:17:20,573 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 01:17:20,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:17:20,574 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 34 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:20,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 723 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:17:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 01:17:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 341. [2025-03-04 01:17:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.2897526501766785) internal successors, (365), 284 states have internal predecessors, (365), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:17:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 469 transitions. [2025-03-04 01:17:20,600 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 469 transitions. Word has length 180 [2025-03-04 01:17:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:20,600 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 469 transitions. [2025-03-04 01:17:20,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:17:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 469 transitions. [2025-03-04 01:17:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:17:20,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:20,603 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:17:20,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:17:20,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:20,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:20,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 811175744, now seen corresponding path program 1 times [2025-03-04 01:17:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:20,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103158465] [2025-03-04 01:17:20,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:20,805 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-04 01:17:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:20,806 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:17:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:17:20,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:17:21,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:17:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:21,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:17:21,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:23,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:17:26,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2025-03-04 01:17:26,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:17:26,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2025-03-04 01:17:26,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2025-03-04 01:17:27,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:27,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2025-03-04 01:17:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 543 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-04 01:17:27,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:29,521 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 118 treesize of output 110 [2025-03-04 01:17:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:17:29,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103158465] [2025-03-04 01:17:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103158465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:17:29,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:29,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-04 01:17:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126663163] [2025-03-04 01:17:29,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:17:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:17:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:29,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:17:29,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:17:29,985 INFO L87 Difference]: Start difference. First operand 341 states and 469 transitions. Second operand has 22 states, 20 states have (on average 6.75) internal successors, (135), 21 states have internal predecessors, (135), 8 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (46), 6 states have call predecessors, (46), 8 states have call successors, (46)