./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.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-49.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 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:18:01,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:18:01,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:18:01,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:18:01,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:18:01,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:18:01,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:18:01,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:18:01,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:18:01,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:18:01,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:18:01,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:18:01,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:18:01,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:18:01,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:18:01,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:18:01,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:18:01,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:18:01,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:18:01,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:18:01,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:18:01,492 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 -> 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f [2025-03-04 01:18:01,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:18:01,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:18:01,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:18:01,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:18:01,728 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:18:01,729 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-49.i [2025-03-04 01:18:02,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bd78b3d/f007aad940a946a88b58c7de866df172/FLAG60b74d935 [2025-03-04 01:18:03,059 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:18:03,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2025-03-04 01:18:03,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bd78b3d/f007aad940a946a88b58c7de866df172/FLAG60b74d935 [2025-03-04 01:18:03,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bd78b3d/f007aad940a946a88b58c7de866df172 [2025-03-04 01:18:03,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:18:03,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:18:03,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:18:03,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:18:03,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:18:03,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03, skipping insertion in model container [2025-03-04 01:18:03,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:18:03,520 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-49.i[917,930] [2025-03-04 01:18:03,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:18:03,587 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:18:03,596 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-49.i[917,930] [2025-03-04 01:18:03,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:18:03,646 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:18:03,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03 WrapperNode [2025-03-04 01:18:03,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:18:03,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:18:03,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:18:03,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:18:03,653 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:18:03" (1/1) ... [2025-03-04 01:18:03,671 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:18:03" (1/1) ... [2025-03-04 01:18:03,708 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 671 [2025-03-04 01:18:03,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:18:03,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:18:03,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:18:03,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:18:03,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,747 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2025-03-04 01:18:03,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:18:03,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:18:03,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:18:03,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:18:03,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (1/1) ... [2025-03-04 01:18:03,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:18:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:18:03,807 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:18:03,812 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:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:18:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:18:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:18:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:18:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:18:03,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:18:03,956 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:18:04,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem106#1;havoc property_#t~ite158#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite156#1;havoc property_#t~mem149#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite113#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite121#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite148#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite134#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem140#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite147#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem150#1;havoc property_#t~ite155#1;havoc property_#t~mem152#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~mem157#1;havoc property_#t~mem163#1;havoc property_#t~mem159#1;havoc property_#t~ite162#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~short164#1;havoc property_#t~mem165#1;havoc property_#t~bitwise166#1;havoc property_#t~mem167#1;havoc property_#t~ite174#1;havoc property_#t~mem171#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~short170#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~short175#1;havoc property_#t~mem176#1;havoc property_#t~ite190#1;havoc property_#t~mem182#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~ite189#1;havoc property_#t~mem186#1;havoc property_#t~mem183#1;havoc property_#t~mem184#1;havoc property_#t~short185#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short191#1; [2025-03-04 01:18:04,396 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2025-03-04 01:18:04,397 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:18:04,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:18:04,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:18:04,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:18:04 BoogieIcfgContainer [2025-03-04 01:18:04,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:18:04,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:18:04,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:18:04,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:18:04,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:18:03" (1/3) ... [2025-03-04 01:18:04,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac9441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:18:04, skipping insertion in model container [2025-03-04 01:18:04,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:03" (2/3) ... [2025-03-04 01:18:04,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac9441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:18:04, skipping insertion in model container [2025-03-04 01:18:04,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:18:04" (3/3) ... [2025-03-04 01:18:04,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-49.i [2025-03-04 01:18:04,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:18:04,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-49.i that has 2 procedures, 135 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:18:04,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:18:04,494 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;@22f0d6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:18:04,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:18:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 119 states have internal predecessors, (173), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:18:04,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:04,509 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:04,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:04,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1999135117, now seen corresponding path program 1 times [2025-03-04 01:18:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:18:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482648767] [2025-03-04 01:18:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:04,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:18:04,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:18:04,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:18:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:18:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:18:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482648767] [2025-03-04 01:18:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482648767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866670979] [2025-03-04 01:18:04,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:18:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:18:04,765 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:18:04,766 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:18:04,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:18:04,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:18:04,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:04,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:04,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:18:04,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:18:04,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:04,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866670979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:04,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:18:04,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:18:04,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430217737] [2025-03-04 01:18:04,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:04,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:18:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:18:04,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:18:04,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:18:04,998 INFO L87 Difference]: Start difference. First operand has 135 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 119 states have internal predecessors, (173), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:18:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:05,028 INFO L93 Difference]: Finished difference Result 264 states and 411 transitions. [2025-03-04 01:18:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:18:05,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-04 01:18:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:05,035 INFO L225 Difference]: With dead ends: 264 [2025-03-04 01:18:05,036 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 01:18:05,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:18:05,040 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:05,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:18:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 01:18:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 01:18:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 116 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2025-03-04 01:18:05,075 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 117 [2025-03-04 01:18:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:05,075 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2025-03-04 01:18:05,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:18:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2025-03-04 01:18:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:18:05,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:05,079 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:05,086 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:18:05,280 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:18:05,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:05,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1288821063, now seen corresponding path program 1 times [2025-03-04 01:18:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:18:05,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76144345] [2025-03-04 01:18:05,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:18:05,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:18:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:18:05,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:05,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:05,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:18:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76144345] [2025-03-04 01:18:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76144345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:05,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:18:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602290615] [2025-03-04 01:18:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:18:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:18:05,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:18:05,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:18:05,842 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:06,078 INFO L93 Difference]: Finished difference Result 345 states and 511 transitions. [2025-03-04 01:18:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:18:06,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-04 01:18:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:06,081 INFO L225 Difference]: With dead ends: 345 [2025-03-04 01:18:06,083 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 01:18:06,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:18:06,084 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 119 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:06,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 842 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 01:18:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2025-03-04 01:18:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 188 states have (on average 1.4414893617021276) internal successors, (271), 189 states have internal predecessors, (271), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:18:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 315 transitions. [2025-03-04 01:18:06,109 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 315 transitions. Word has length 117 [2025-03-04 01:18:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 315 transitions. [2025-03-04 01:18:06,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 315 transitions. [2025-03-04 01:18:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:18:06,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:06,113 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:06,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:18:06,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:06,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -901039964, now seen corresponding path program 1 times [2025-03-04 01:18:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:18:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827267157] [2025-03-04 01:18:06,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:18:06,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:06,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:06,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-04 01:18:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:18:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827267157] [2025-03-04 01:18:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827267157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290315012] [2025-03-04 01:18:07,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:07,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:18:07,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:18:07,206 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:18:07,208 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:18:07,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:07,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:07,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:07,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:07,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:18:07,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:07,508 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:18:07,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:18:08,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:18:08,461 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 25 treesize of output 13 [2025-03-04 01:18:08,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:18:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 01:18:08,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290315012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:08,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-04 01:18:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494640335] [2025-03-04 01:18:08,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:18:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:18:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:18:08,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:18:08,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:18:08,610 INFO L87 Difference]: Start difference. First operand 213 states and 315 transitions. Second operand has 19 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 8 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-04 01:18:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:08,985 INFO L93 Difference]: Finished difference Result 441 states and 643 transitions. [2025-03-04 01:18:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:18:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 8 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 119 [2025-03-04 01:18:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:08,988 INFO L225 Difference]: With dead ends: 441 [2025-03-04 01:18:08,988 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 01:18:08,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:18:08,989 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 229 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:08,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1283 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 01:18:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2025-03-04 01:18:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 194 states have (on average 1.422680412371134) internal successors, (276), 195 states have internal predecessors, (276), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:18:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 320 transitions. [2025-03-04 01:18:09,018 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 320 transitions. Word has length 119 [2025-03-04 01:18:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:09,018 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 320 transitions. [2025-03-04 01:18:09,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 8 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-04 01:18:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 320 transitions. [2025-03-04 01:18:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:18:09,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:09,020 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:09,027 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:18:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 01:18:09,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:09,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash -579636126, now seen corresponding path program 1 times [2025-03-04 01:18:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:18:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668135393] [2025-03-04 01:18:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:18:09,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:18:09,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:18:09,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:09,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:18:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:18:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668135393] [2025-03-04 01:18:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668135393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075539044] [2025-03-04 01:18:09,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:09,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:18:09,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:18:09,923 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:18:09,924 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:18:10,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:18:10,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:18:10,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:10,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:10,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:18:10,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:10,241 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:18:10,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:18:10,929 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 25 treesize of output 13 [2025-03-04 01:18:10,958 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-04 01:18:10,958 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 1 case distinctions, treesize of input 25 treesize of output 20 [2025-03-04 01:18:11,014 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 01:18:11,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-03-04 01:18:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 01:18:11,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075539044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:11,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:11,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-04 01:18:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738486555] [2025-03-04 01:18:11,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:18:11,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:18:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:18:11,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:18:11,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:18:11,144 INFO L87 Difference]: Start difference. First operand 221 states and 320 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 7 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2025-03-04 01:18:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:11,684 INFO L93 Difference]: Finished difference Result 603 states and 863 transitions. [2025-03-04 01:18:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:18:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 7 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) Word has length 121 [2025-03-04 01:18:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:11,687 INFO L225 Difference]: With dead ends: 603 [2025-03-04 01:18:11,687 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 01:18:11,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:18:11,688 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1505 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:11,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1065 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:18:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 01:18:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 233. [2025-03-04 01:18:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.411764705882353) internal successors, (288), 205 states have internal predecessors, (288), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:18:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 332 transitions. [2025-03-04 01:18:11,708 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 332 transitions. Word has length 121 [2025-03-04 01:18:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:11,708 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 332 transitions. [2025-03-04 01:18:11,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 7 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2025-03-04 01:18:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 332 transitions. [2025-03-04 01:18:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:18:11,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:11,710 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:11,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:18:11,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:18:11,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:11,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash -873039133, now seen corresponding path program 1 times [2025-03-04 01:18:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:18:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671356596] [2025-03-04 01:18:11,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:18:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:18:11,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:18:11,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:11,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:18:11,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:18:11,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:18:12,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:18:12,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:12,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:18:12,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:18:12,089 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:18:12,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:18:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:18:12,093 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 01:18:12,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:18:12,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:18:12 BoogieIcfgContainer [2025-03-04 01:18:12,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:18:12,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:18:12,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:18:12,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:18:12,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:18:04" (3/4) ... [2025-03-04 01:18:12,220 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:18:12,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:18:12,221 INFO L158 Benchmark]: Toolchain (without parser) took 8818.43ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 108.6MB in the beginning and 217.6MB in the end (delta: -109.0MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. [2025-03-04 01:18:12,221 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:18:12,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.05ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 91.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:18:12,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.28ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 86.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:18:12,222 INFO L158 Benchmark]: Boogie Preprocessor took 65.00ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 82.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:18:12,222 INFO L158 Benchmark]: IcfgBuilder took 636.77ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 102.2MB in the end (delta: -20.1MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2025-03-04 01:18:12,222 INFO L158 Benchmark]: TraceAbstraction took 7800.13ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 101.5MB in the beginning and 217.7MB in the end (delta: -116.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2025-03-04 01:18:12,222 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 369.1MB. Free memory was 217.7MB in the beginning and 217.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:18:12,224 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.05ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 91.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.28ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 86.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.00ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 82.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 636.77ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 102.2MB in the end (delta: -20.1MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7800.13ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 101.5MB in the beginning and 217.7MB in the end (delta: -116.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 369.1MB. Free memory was 217.7MB in the beginning and 217.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [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-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L29-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L29-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L32] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L33] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L42] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L43] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L44] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L45] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=0, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L77] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L78] 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L78] 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L78] 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L80] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L81] EXPR 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L81] CALL assume_abort_if_not(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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L81] RET assume_abort_if_not(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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] EXPR 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] CALL assume_abort_if_not(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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] RET assume_abort_if_not(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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L87] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] EXPR signed_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L90] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L91] CALL assume_abort_if_not(unsigned_short_int_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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L91] RET assume_abort_if_not(unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] EXPR unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L93] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L94] CALL assume_abort_if_not(unsigned_short_int_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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L94] RET assume_abort_if_not(unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] EXPR unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L96] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L97] EXPR unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] EXPR unsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) 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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L111] RET updateVariables() [L112] CALL step() [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L49] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) [L50] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L50] EXPR 50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L50] COND FALSE !((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L53] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) [L55] EXPR \read(*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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L55] COND TRUE ! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L56] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L56] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L56] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L56] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) [L59] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L59] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) [L62] EXPR \read(*float_Array_0_arrayfloat_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L62] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f [L63] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L63] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L63] COND FALSE !((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L66] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L66] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*float_Array_0_arrayfloat_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50)) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50)) 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103-L104] return (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] 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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [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:2}, 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:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1866 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1853 mSDsluCounter, 3384 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2634 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 750 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 399 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 165 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 824 ConstructedInterpolants, 3 QuantifiedInterpolants, 6294 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1339 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 2174/2548 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:18:12,243 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-49.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 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:18:14,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:18:14,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:18:14,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:18:14,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:18:14,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:18:14,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:18:14,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:18:14,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:18:14,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:18:14,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:18:14,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:18:14,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:18:14,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:18:14,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:18:14,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:18:14,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:18:14,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:18:14,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:18:14,244 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 -> 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f [2025-03-04 01:18:14,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:18:14,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:18:14,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:18:14,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:18:14,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:18:14,476 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-49.i [2025-03-04 01:18:15,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2148e8dea/d10d994bacd242a2afbb033092577f06/FLAG6d9de1fae [2025-03-04 01:18:15,905 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:18:15,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2025-03-04 01:18:15,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2148e8dea/d10d994bacd242a2afbb033092577f06/FLAG6d9de1fae [2025-03-04 01:18:15,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2148e8dea/d10d994bacd242a2afbb033092577f06 [2025-03-04 01:18:15,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:18:15,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:18:15,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:18:15,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:18:15,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:18:15,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:18:15" (1/1) ... [2025-03-04 01:18:15,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bb063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:15, skipping insertion in model container [2025-03-04 01:18:15,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:18:15" (1/1) ... [2025-03-04 01:18:15,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:18:16,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i[917,930] [2025-03-04 01:18:16,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:18:16,131 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:18:16,139 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-49.i[917,930] [2025-03-04 01:18:16,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:18:16,211 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:18:16,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16 WrapperNode [2025-03-04 01:18:16,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:18:16,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:18:16,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:18:16,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:18:16,220 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:18:16" (1/1) ... [2025-03-04 01:18:16,240 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:18:16" (1/1) ... [2025-03-04 01:18:16,278 INFO L138 Inliner]: procedures = 33, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 656 [2025-03-04 01:18:16,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:18:16,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:18:16,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:18:16,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:18:16,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,331 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2025-03-04 01:18:16,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:18:16,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:18:16,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:18:16,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:18:16,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (1/1) ... [2025-03-04 01:18:16,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:18:16,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:18:16,401 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:18:16,405 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:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:18:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:18:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:18:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:18:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:18:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:18:16,537 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:18:16,538 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:18:17,046 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem105#1;havoc property_#t~ite157#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite155#1;havoc property_#t~mem148#1;havoc property_#t~mem113#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite147#1;havoc property_#t~mem126#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~ite146#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem162#1;havoc property_#t~mem158#1;havoc property_#t~ite161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~short163#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite172#1;havoc property_#t~mem169#1;havoc property_#t~mem166#1;havoc property_#t~mem167#1;havoc property_#t~short168#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1;havoc property_#t~mem174#1;havoc property_#t~ite188#1;havoc property_#t~mem180#1;havoc property_#t~mem175#1;havoc property_#t~mem176#1;havoc property_#t~ite179#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite187#1;havoc property_#t~mem184#1;havoc property_#t~mem181#1;havoc property_#t~mem182#1;havoc property_#t~short183#1;havoc property_#t~mem186#1;havoc property_#t~mem185#1;havoc property_#t~short189#1; [2025-03-04 01:18:17,088 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2025-03-04 01:18:17,088 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:18:17,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:18:17,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:18:17,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:18:17 BoogieIcfgContainer [2025-03-04 01:18:17,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:18:17,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:18:17,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:18:17,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:18:17,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:18:15" (1/3) ... [2025-03-04 01:18:17,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dca37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:18:17, skipping insertion in model container [2025-03-04 01:18:17,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:18:16" (2/3) ... [2025-03-04 01:18:17,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dca37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:18:17, skipping insertion in model container [2025-03-04 01:18:17,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:18:17" (3/3) ... [2025-03-04 01:18:17,105 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-49.i [2025-03-04 01:18:17,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:18:17,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-49.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:18:17,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:18:17,168 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;@55b88866, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:18:17,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:18:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 113 states have internal predecessors, (165), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:18:17,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:17,180 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:17,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1381507835, now seen corresponding path program 1 times [2025-03-04 01:18:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778538610] [2025-03-04 01:18:17,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:17,192 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:18:17,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:17,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:18:17,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:18:17,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:18:17,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:18:17,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:17,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:17,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:18:17,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-04 01:18:17,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:17,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:17,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778538610] [2025-03-04 01:18:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778538610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:17,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:18:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787125306] [2025-03-04 01:18:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:18:17,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:17,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:18:17,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:18:17,555 INFO L87 Difference]: Start difference. First operand has 129 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 113 states have internal predecessors, (165), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:18:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:17,583 INFO L93 Difference]: Finished difference Result 252 states and 395 transitions. [2025-03-04 01:18:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:18:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-04 01:18:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:17,590 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:18:17,591 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 01:18:17,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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:18:17,597 INFO L435 NwaCegarLoop]: 188 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, 188 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:18:17,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:18:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 01:18:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-04 01:18:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2025-03-04 01:18:17,630 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 115 [2025-03-04 01:18:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2025-03-04 01:18:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:18:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2025-03-04 01:18:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:18:17,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:17,638 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:17,646 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:18:17,838 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:18:17,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -220545831, now seen corresponding path program 1 times [2025-03-04 01:18:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170748151] [2025-03-04 01:18:17,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:17,840 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:18:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:17,841 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:18:17,842 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:18:17,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:18:18,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:18:18,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:18,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:18:18,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:18,128 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:18:18,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-04 01:18:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:18,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:18,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170748151] [2025-03-04 01:18:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170748151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:18:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763270778] [2025-03-04 01:18:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:18:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:18,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:18:18,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:18:18,185 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:18,452 INFO L93 Difference]: Finished difference Result 330 states and 491 transitions. [2025-03-04 01:18:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:18:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:18:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:18,455 INFO L225 Difference]: With dead ends: 330 [2025-03-04 01:18:18,455 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 01:18:18,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:18:18,456 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 115 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:18,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 727 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 01:18:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2025-03-04 01:18:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 179 states have (on average 1.446927374301676) internal successors, (259), 180 states have internal predecessors, (259), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:18:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 303 transitions. [2025-03-04 01:18:18,482 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 303 transitions. Word has length 115 [2025-03-04 01:18:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:18,482 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 303 transitions. [2025-03-04 01:18:18,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 303 transitions. [2025-03-04 01:18:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:18:18,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:18,488 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:18,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:18:18,688 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:18:18,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:18,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1088404361, now seen corresponding path program 1 times [2025-03-04 01:18:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572288108] [2025-03-04 01:18:18,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:18,690 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:18:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:18,692 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:18:18,693 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:18:18,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:18:18,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:18:18,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:18,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:18,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:18:18,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:19,093 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:18:19,386 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 25 treesize of output 13 [2025-03-04 01:18:20,136 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 25 treesize of output 13 [2025-03-04 01:18:20,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:18:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 01:18:20,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:20,282 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572288108] [2025-03-04 01:18:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572288108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1011450472] [2025-03-04 01:18:20,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:20,282 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:20,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:18:20,301 INFO L229 MonitoredProcess]: Starting monitored process 5 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:18:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-04 01:18:20,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:18:20,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:18:20,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:20,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:20,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:18:20,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:21,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:18:21,521 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 33 treesize of output 17 [2025-03-04 01:18:22,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 01:18:22,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:18:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 01:18:22,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1011450472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:22,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2025-03-04 01:18:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806756035] [2025-03-04 01:18:22,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:18:22,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:18:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:22,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:18:22,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:18:22,809 INFO L87 Difference]: Start difference. First operand 204 states and 303 transitions. Second operand has 19 states, 17 states have (on average 5.647058823529412) internal successors, (96), 16 states have internal predecessors, (96), 6 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2025-03-04 01:18:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:23,398 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2025-03-04 01:18:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:18:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.647058823529412) internal successors, (96), 16 states have internal predecessors, (96), 6 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 117 [2025-03-04 01:18:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:23,401 INFO L225 Difference]: With dead ends: 423 [2025-03-04 01:18:23,401 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 01:18:23,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:18:23,405 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 587 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:23,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1116 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:18:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 01:18:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2025-03-04 01:18:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.427027027027027) internal successors, (264), 186 states have internal predecessors, (264), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:18:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 308 transitions. [2025-03-04 01:18:23,434 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 308 transitions. Word has length 117 [2025-03-04 01:18:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:23,434 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 308 transitions. [2025-03-04 01:18:23,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.647058823529412) internal successors, (96), 16 states have internal predecessors, (96), 6 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2025-03-04 01:18:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 308 transitions. [2025-03-04 01:18:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:18:23,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:23,436 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:23,448 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:18:23,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-04 01:18:23,837 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:23,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash -921853163, now seen corresponding path program 1 times [2025-03-04 01:18:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720228557] [2025-03-04 01:18:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:23,839 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:18:23,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:23,841 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:18:23,843 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:18:23,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:24,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:24,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:18:24,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:24,545 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:18:24,920 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 38 treesize of output 29 [2025-03-04 01:18:25,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:25,266 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 63 treesize of output 39 [2025-03-04 01:18:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:18:25,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:25,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720228557] [2025-03-04 01:18:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720228557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1533923229] [2025-03-04 01:18:25,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:25,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:25,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:18:25,990 INFO L229 MonitoredProcess]: Starting monitored process 7 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:18:25,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-04 01:18:26,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:26,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:26,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:26,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:18:26,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:27,126 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:18:27,516 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:18:28,039 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 0 case distinctions, treesize of input 67 treesize of output 39 [2025-03-04 01:18:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:18:28,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:28,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1533923229] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:28,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:28,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 13] total 30 [2025-03-04 01:18:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393175818] [2025-03-04 01:18:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:28,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:18:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:28,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:18:28,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:18:28,668 INFO L87 Difference]: Start difference. First operand 212 states and 308 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:29,290 INFO L93 Difference]: Finished difference Result 792 states and 1151 transitions. [2025-03-04 01:18:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:18:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:18:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:29,293 INFO L225 Difference]: With dead ends: 792 [2025-03-04 01:18:29,293 INFO L226 Difference]: Without dead ends: 583 [2025-03-04 01:18:29,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=276, Invalid=1530, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 01:18:29,295 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 553 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:29,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1743 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:18:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-04 01:18:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 473. [2025-03-04 01:18:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 430 states have (on average 1.4651162790697674) internal successors, (630), 433 states have internal predecessors, (630), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:18:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 698 transitions. [2025-03-04 01:18:29,329 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 698 transitions. Word has length 119 [2025-03-04 01:18:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:29,331 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 698 transitions. [2025-03-04 01:18:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 698 transitions. [2025-03-04 01:18:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:18:29,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:29,334 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:29,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-04 01:18:29,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:18:29,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:18:29,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:29,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1118366668, now seen corresponding path program 1 times [2025-03-04 01:18:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435527853] [2025-03-04 01:18:29,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:29,736 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:18:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:29,737 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:18:29,739 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:18:29,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:29,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:29,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:18:29,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:30,406 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 23 treesize of output 22 [2025-03-04 01:18:30,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:30,468 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 27 treesize of output 15 [2025-03-04 01:18:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:30,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:30,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435527853] [2025-03-04 01:18:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435527853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:18:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548630864] [2025-03-04 01:18:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:18:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:30,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:18:30,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:18:30,481 INFO L87 Difference]: Start difference. First operand 473 states and 698 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:30,756 INFO L93 Difference]: Finished difference Result 1392 states and 2056 transitions. [2025-03-04 01:18:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:18:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:18:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:30,760 INFO L225 Difference]: With dead ends: 1392 [2025-03-04 01:18:30,760 INFO L226 Difference]: Without dead ends: 922 [2025-03-04 01:18:30,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:18:30,761 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 407 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:30,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 772 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-04 01:18:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 633. [2025-03-04 01:18:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 590 states have (on average 1.4915254237288136) internal successors, (880), 593 states have internal predecessors, (880), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:18:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 948 transitions. [2025-03-04 01:18:30,791 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 948 transitions. Word has length 119 [2025-03-04 01:18:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:30,792 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 948 transitions. [2025-03-04 01:18:30,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 948 transitions. [2025-03-04 01:18:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:18:30,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:30,793 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:30,802 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:18:30,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:18:30,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 196203956, now seen corresponding path program 1 times [2025-03-04 01:18:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518696665] [2025-03-04 01:18:30,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:30,995 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:18:30,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:30,997 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:18:30,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:18:31,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:31,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:31,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:31,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:31,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:18:31,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:31,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-03-04 01:18:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:18:31,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:40,249 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2025-03-04 01:18:40,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 48 [2025-03-04 01:18:44,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518696665] [2025-03-04 01:18:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518696665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1637078879] [2025-03-04 01:18:44,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:18:44,344 INFO L229 MonitoredProcess]: Starting monitored process 10 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:18:44,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:18:44,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:44,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:44,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:44,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:44,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:18:44,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:44,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-04 01:18:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:44,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1637078879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:44,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:18:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-04 01:18:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404552304] [2025-03-04 01:18:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:18:44,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:44,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:18:44,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=223, Unknown=3, NotChecked=0, Total=272 [2025-03-04 01:18:44,898 INFO L87 Difference]: Start difference. First operand 633 states and 948 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:45,062 INFO L93 Difference]: Finished difference Result 1273 states and 1900 transitions. [2025-03-04 01:18:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:18:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:18:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:45,066 INFO L225 Difference]: With dead ends: 1273 [2025-03-04 01:18:45,066 INFO L226 Difference]: Without dead ends: 643 [2025-03-04 01:18:45,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2025-03-04 01:18:45,069 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 115 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:45,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 850 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:18:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-04 01:18:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2025-03-04 01:18:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 596 states have (on average 1.4781879194630871) internal successors, (881), 599 states have internal predecessors, (881), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:18:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 949 transitions. [2025-03-04 01:18:45,098 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 949 transitions. Word has length 119 [2025-03-04 01:18:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:45,099 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 949 transitions. [2025-03-04 01:18:45,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 949 transitions. [2025-03-04 01:18:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:18:45,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:45,103 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:45,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:18:45,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:18:45,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:45,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:45,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1918925516, now seen corresponding path program 1 times [2025-03-04 01:18:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752932046] [2025-03-04 01:18:45,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:18:45,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:45,506 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:18:45,507 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:18:45,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:45,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:45,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:45,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:45,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:18:45,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:46,410 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:18:46,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:46,678 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 59 treesize of output 35 [2025-03-04 01:18:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:18:46,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:47,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752932046] [2025-03-04 01:18:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752932046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1614091331] [2025-03-04 01:18:47,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:18:47,357 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:18:47,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:18:47,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:48,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:48,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:48,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:48,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 01:18:48,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:48,484 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:18:49,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2025-03-04 01:18:49,537 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 0 case distinctions, treesize of input 73 treesize of output 45 [2025-03-04 01:18:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:18:49,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1614091331] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 12] total 29 [2025-03-04 01:18:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195092058] [2025-03-04 01:18:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:50,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:18:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:50,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:18:50,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:18:50,156 INFO L87 Difference]: Start difference. First operand 641 states and 949 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:50,953 INFO L93 Difference]: Finished difference Result 1724 states and 2538 transitions. [2025-03-04 01:18:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:18:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:18:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:50,961 INFO L225 Difference]: With dead ends: 1724 [2025-03-04 01:18:50,961 INFO L226 Difference]: Without dead ends: 1086 [2025-03-04 01:18:50,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 01:18:50,964 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 423 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:50,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2472 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:18:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-03-04 01:18:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 642. [2025-03-04 01:18:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 597 states have (on average 1.4790619765494137) internal successors, (883), 600 states have internal predecessors, (883), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:18:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 951 transitions. [2025-03-04 01:18:50,998 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 951 transitions. Word has length 119 [2025-03-04 01:18:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:50,999 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 951 transitions. [2025-03-04 01:18:50,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 951 transitions. [2025-03-04 01:18:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:18:51,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:51,003 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:51,013 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:18:51,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-04 01:18:51,404 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:51,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:51,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash 126397813, now seen corresponding path program 1 times [2025-03-04 01:18:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:51,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003194812] [2025-03-04 01:18:51,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:51,405 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:18:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:51,407 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:18:51,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:18:51,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:18:51,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:18:51,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:51,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:51,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:18:51,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:52,306 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:18:52,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:52,499 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 56 treesize of output 32 [2025-03-04 01:18:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:18:52,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:18:52,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003194812] [2025-03-04 01:18:52,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003194812] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:52,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:18:52,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2025-03-04 01:18:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190130052] [2025-03-04 01:18:52,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:52,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:18:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:52,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:18:52,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:18:52,746 INFO L87 Difference]: Start difference. First operand 642 states and 951 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:53,088 INFO L93 Difference]: Finished difference Result 1403 states and 2059 transitions. [2025-03-04 01:18:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:18:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:18:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:53,093 INFO L225 Difference]: With dead ends: 1403 [2025-03-04 01:18:53,093 INFO L226 Difference]: Without dead ends: 764 [2025-03-04 01:18:53,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:18:53,095 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 143 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:53,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 2204 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-04 01:18:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 642. [2025-03-04 01:18:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 597 states have (on average 1.4790619765494137) internal successors, (883), 600 states have internal predecessors, (883), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:18:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 951 transitions. [2025-03-04 01:18:53,126 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 951 transitions. Word has length 119 [2025-03-04 01:18:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:53,126 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 951 transitions. [2025-03-04 01:18:53,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:18:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 951 transitions. [2025-03-04 01:18:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:18:53,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:53,128 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:18:53,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:18:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:18:53,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:53,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1194337672, now seen corresponding path program 1 times [2025-03-04 01:18:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521108937] [2025-03-04 01:18:53,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:53,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:18:53,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:53,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:18:53,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:18:53,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:18:53,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:18:53,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:53,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:53,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:18:53,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:54,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-03-04 01:18:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:18:54,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:02,569 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2025-03-04 01:19:02,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 48 [2025-03-04 01:19:06,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:19:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521108937] [2025-03-04 01:19:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521108937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1764249527] [2025-03-04 01:19:06,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:06,680 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:19:06,683 INFO L229 MonitoredProcess]: Starting monitored process 15 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:19:06,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-04 01:19:06,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:07,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:07,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:07,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:07,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:19:07,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:07,272 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 46 treesize of output 22 [2025-03-04 01:19:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:19:07,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:19:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1764249527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:07,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:19:07,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-04 01:19:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219042261] [2025-03-04 01:19:07,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:07,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:19:07,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:07,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=165, Unknown=3, NotChecked=0, Total=210 [2025-03-04 01:19:07,301 INFO L87 Difference]: Start difference. First operand 642 states and 951 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:19:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:07,441 INFO L93 Difference]: Finished difference Result 1181 states and 1731 transitions. [2025-03-04 01:19:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:19:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:07,444 INFO L225 Difference]: With dead ends: 1181 [2025-03-04 01:19:07,444 INFO L226 Difference]: Without dead ends: 542 [2025-03-04 01:19:07,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=49, Invalid=188, Unknown=3, NotChecked=0, Total=240 [2025-03-04 01:19:07,447 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 52 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:07,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 729 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-04 01:19:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2025-03-04 01:19:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 493 states have (on average 1.438133874239351) internal successors, (709), 496 states have internal predecessors, (709), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:19:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 777 transitions. [2025-03-04 01:19:07,484 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 777 transitions. Word has length 121 [2025-03-04 01:19:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:07,484 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 777 transitions. [2025-03-04 01:19:07,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:19:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 777 transitions. [2025-03-04 01:19:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:19:07,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:07,486 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:07,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2025-03-04 01:19:07,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-04 01:19:07,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:19:07,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:07,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash 432531919, now seen corresponding path program 1 times [2025-03-04 01:19:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:19:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718820660] [2025-03-04 01:19:07,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:07,888 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:19:07,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:19:07,890 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:19:07,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-03-04 01:19:07,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:08,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:08,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:08,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:08,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:19:08,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:09,266 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 61 treesize of output 41 [2025-03-04 01:19:09,343 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 33 treesize of output 24 [2025-03-04 01:19:09,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:19:09,455 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 94 treesize of output 62 [2025-03-04 01:19:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 01:19:09,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:10,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:19:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718820660] [2025-03-04 01:19:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718820660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [419881059] [2025-03-04 01:19:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:10,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:19:10,276 INFO L229 MonitoredProcess]: Starting monitored process 17 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:19:10,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-04 01:19:10,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:10,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:10,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:11,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:19:11,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:11,275 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:19:12,447 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 61 treesize of output 41 [2025-03-04 01:19:12,561 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 33 treesize of output 24 [2025-03-04 01:19:12,751 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 0 case distinctions, treesize of input 140 treesize of output 92 [2025-03-04 01:19:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 01:19:12,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [419881059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:13,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:19:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2025-03-04 01:19:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237570142] [2025-03-04 01:19:13,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:19:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:19:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:19:13,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:19:13,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:19:13,228 INFO L87 Difference]: Start difference. First operand 540 states and 777 transitions. Second operand has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2025-03-04 01:19:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:14,209 INFO L93 Difference]: Finished difference Result 1219 states and 1741 transitions. [2025-03-04 01:19:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:19:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 121 [2025-03-04 01:19:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:14,212 INFO L225 Difference]: With dead ends: 1219 [2025-03-04 01:19:14,212 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 01:19:14,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:19:14,214 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1109 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:14,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1655 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:19:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 01:19:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 606. [2025-03-04 01:19:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 559 states have (on average 1.441860465116279) internal successors, (806), 562 states have internal predecessors, (806), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:19:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 874 transitions. [2025-03-04 01:19:14,241 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 874 transitions. Word has length 121 [2025-03-04 01:19:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 874 transitions. [2025-03-04 01:19:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2025-03-04 01:19:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 874 transitions. [2025-03-04 01:19:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:19:14,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:14,243 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:14,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-03-04 01:19:14,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-04 01:19:14,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:14,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:14,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1613715438, now seen corresponding path program 1 times [2025-03-04 01:19:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:19:14,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126239503] [2025-03-04 01:19:14,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:14,644 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:19:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:19:14,647 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:19:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-03-04 01:19:14,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:14,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:14,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:14,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:14,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:19:14,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:15,746 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 39 treesize of output 30 [2025-03-04 01:19:15,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 01:19:16,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:19:16,245 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 78 treesize of output 46 [2025-03-04 01:19:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 7 proven. 213 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:19:16,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:16,625 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 30 treesize of output 22 [2025-03-04 01:19:16,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:19:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126239503] [2025-03-04 01:19:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126239503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [137136669] [2025-03-04 01:19:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:19:16,960 INFO L229 MonitoredProcess]: Starting monitored process 19 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:19:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-04 01:19:17,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:17,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:17,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:17,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:17,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 01:19:17,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:18,076 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:19:18,761 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 39 treesize of output 30 [2025-03-04 01:19:18,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 01:19:19,541 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 0 case distinctions, treesize of input 78 treesize of output 46 [2025-03-04 01:19:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 7 proven. 213 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:19:19,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:20,138 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 30 treesize of output 22 [2025-03-04 01:19:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:19:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [137136669] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:19:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18, 18] total 42 [2025-03-04 01:19:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739340652] [2025-03-04 01:19:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:20,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:19:20,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:19:20,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:19:20,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=2157, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 01:19:20,420 INFO L87 Difference]: Start difference. First operand 606 states and 874 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:19:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:22,632 INFO L93 Difference]: Finished difference Result 1355 states and 1939 transitions. [2025-03-04 01:19:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:19:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:19:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:22,634 INFO L225 Difference]: With dead ends: 1355 [2025-03-04 01:19:22,634 INFO L226 Difference]: Without dead ends: 752 [2025-03-04 01:19:22,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=483, Invalid=2823, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 01:19:22,636 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 462 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2225 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:19:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-04 01:19:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 553. [2025-03-04 01:19:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 506 states have (on average 1.4328063241106719) internal successors, (725), 509 states have internal predecessors, (725), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:19:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 793 transitions. [2025-03-04 01:19:22,667 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 793 transitions. Word has length 121 [2025-03-04 01:19:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:22,668 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 793 transitions. [2025-03-04 01:19:22,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:19:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 793 transitions. [2025-03-04 01:19:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:19:22,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:22,669 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:22,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-04 01:19:22,882 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 (18)] Ended with exit code 0 [2025-03-04 01:19:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:19:23,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:23,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash -890015949, now seen corresponding path program 1 times [2025-03-04 01:19:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:19:23,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628494034] [2025-03-04 01:19:23,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:23,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:19:23,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:19:23,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:19:23,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-03-04 01:19:23,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:23,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:23,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:23,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:23,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:19:23,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:23,938 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 20 treesize of output 20 [2025-03-04 01:19:24,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:19:24,100 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 47 treesize of output 27 [2025-03-04 01:19:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:19:24,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:24,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:19:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628494034] [2025-03-04 01:19:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628494034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1509507581] [2025-03-04 01:19:24,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:24,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:19:24,420 INFO L229 MonitoredProcess]: Starting monitored process 21 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:19:24,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-03-04 01:19:24,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:25,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:25,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:25,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:19:25,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:25,553 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:19:26,136 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 39 treesize of output 30 [2025-03-04 01:19:26,482 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 0 case distinctions, treesize of input 65 treesize of output 37 [2025-03-04 01:19:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 7 proven. 213 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:19:26,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:19:26,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1509507581] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:26,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:19:26,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 15] total 28 [2025-03-04 01:19:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292741866] [2025-03-04 01:19:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:26,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:19:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:19:26,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:19:26,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:19:26,856 INFO L87 Difference]: Start difference. First operand 553 states and 793 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:19:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:27,219 INFO L93 Difference]: Finished difference Result 1225 states and 1737 transitions. [2025-03-04 01:19:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:19:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:19:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:27,222 INFO L225 Difference]: With dead ends: 1225 [2025-03-04 01:19:27,222 INFO L226 Difference]: Without dead ends: 675 [2025-03-04 01:19:27,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:19:27,223 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 278 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:27,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2012 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:19:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-04 01:19:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 457. [2025-03-04 01:19:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 426 states have (on average 1.443661971830986) internal successors, (615), 427 states have internal predecessors, (615), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:19:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 659 transitions. [2025-03-04 01:19:27,249 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 659 transitions. Word has length 121 [2025-03-04 01:19:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:27,249 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 659 transitions. [2025-03-04 01:19:27,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:19:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 659 transitions. [2025-03-04 01:19:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:19:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:27,250 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:27,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-03-04 01:19:27,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-03-04 01:19:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:27,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:27,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash 604042515, now seen corresponding path program 1 times [2025-03-04 01:19:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:19:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113667222] [2025-03-04 01:19:27,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:27,652 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:19:27,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:19:27,653 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:19:27,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-03-04 01:19:27,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:27,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:27,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:19:27,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:28,203 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:19:28,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-03-04 01:19:28,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:19:28,478 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 28 treesize of output 16 [2025-03-04 01:19:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:19:30,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:30,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:19:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113667222] [2025-03-04 01:19:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113667222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [283568818] [2025-03-04 01:19:30,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:30,282 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:19:30,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:19:30,283 INFO L229 MonitoredProcess]: Starting monitored process 23 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:19:30,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-03-04 01:19:30,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:19:30,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:19:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:30,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:19:30,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:31,353 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:19:31,779 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 32 treesize of output 27 [2025-03-04 01:19:31,895 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 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-04 01:19:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:19:31,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [283568818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:31,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:19:31,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 01:19:31,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564683536] [2025-03-04 01:19:31,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:19:31,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:19:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:19:31,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:19:31,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=236, Unknown=1, NotChecked=0, Total=306 [2025-03-04 01:19:31,964 INFO L87 Difference]: Start difference. First operand 457 states and 659 transitions. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 13 states have internal predecessors, (105), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:19:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:34,755 INFO L93 Difference]: Finished difference Result 1033 states and 1473 transitions. [2025-03-04 01:19:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:19:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 13 states have internal predecessors, (105), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 121 [2025-03-04 01:19:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:34,763 INFO L225 Difference]: With dead ends: 1033 [2025-03-04 01:19:34,763 INFO L226 Difference]: Without dead ends: 579 [2025-03-04 01:19:34,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=135, Invalid=370, Unknown=1, NotChecked=0, Total=506 [2025-03-04 01:19:34,764 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 719 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:34,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1465 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:19:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states.